public static int[][] TriangPascal(int n)
		{
			int[][] a= new int[n+1][];
			for(int i=0; i<a.Length; i++)
			{
				a[i]=new int[i+1];
 
				if(i==0)
				{
					a[i][i]=1;
				}
				if(i==1)
				{
					a[i][0]=1;
					a[i][i]=1;
				}
				if(i>1)
				{
					a[i][0]=1;
					a[i][a[i].Length-1]=1;
					for(int j=1; j<a[i].Length-1; j++)
					{
			            a[i][j]=a[i-1][j-1]+a[i-1][j];
					}
				}
 
			}
			return a;