|
%I #2 Mar 30 2012 17:28:33
%S 1,1,1,1,2,1,1,1,1,1,1,2,2,2,1,1,1,0,0,1,1,1,2,1,0,1,2,1,1,1,1,1,1,1,
%T 1,1,1,2,2,2,2,2,2,2,1,1,1,0,0,0,0,0,0,1,1,1,2,1,0,0,0,0,0,1,2,1,1,1,
%U 1,1,0,0,0,0,1,1,1,1,1,2,2,2,1,0,0,0,1,2,2,2,1
%N Triangle, read by rows: T(0,0) = 1, T(n,k) = T(n-1,k-1) (mod 2) + T(n-1,k) (mod 2), T(n,k) = 0 if k < 0 or k > n.
%e Triangle begins:
%e 1,
%e 1,1,
%e 1,2,1,
%e 1,1,1,1,
%e 1,2,2,2,1,
%e 1,1,0,0,1,1,
%e 1,2,1,0,1,2,1,
%e 1,1,1,1,1,1,1,1,
%e 1,2,2,2,2,2,2,2,1,
%e 1,1,0,0,0,0,0,0,1,1,
%e 1,2,1,0,0,0,0,0,1,2,1,
%e 1,1,1,1,0,0,0,0,1,1,1,1,
%e 1,2,2,2,1,0,0,0,1,2,2,2,1,
%e 1,1,0,0,1,1,0,0,1,1,0,0,1,1,
%e 1,2,1,0,1,2,1,0,1,2,1,0,1,2,1,
%e 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
%e 1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,
%e 1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1
%o (PARI) p = 2; s = 13; T=matrix(s,s); T[1,1]=1; for(n=2,s,T[n,1]=1;for(k=2,n,T[n,k]=T[n-1,k-1]%p+T[n-1,k]%p)); for(n=1,s,for(k=1,n,print1(T[n,k],", ")))
%Y A007318 (Pascal's triangle), A047999 (Sierpinski's triangle, Pascal's triangle mod 2).
%K easy,nonn,tabl
%O 0,5
%A _Gerald McGarvey_, Oct 10 2009
|
