|
Search: id:A166280
|
|
| |
|
| 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
EXAMPLE
|
Triangle begins:
1,
1,1,
1,1,1,
1,1,0,1,
1,1,1,0,1,
1,1,0,1,1,1,
1,1,1,0,0,1,1,
1,1,0,1,0,0,0,1,
1,1,1,0,1,0,0,0,1,
1,1,0,1,1,1,0,0,1,1,
1,1,1,0,0,1,1,0,1,1,1,
1,1,0,1,0,0,0,1,1,1,0,1,
1,1,1,0,1,0,0,0,0,1,1,0,1,
...
|
|
PROGRAM
|
(PARI) p = 2; s=14; S2T = matrix(s, s, n, k, if(k==1, 1)); for(n=2, s, for(k=2, n, S2T[n, k]=k*S2T[n-1, k]+S2T[n-1, k-1]));
S2TMP = matrix(s, s, n, k, S2T[n, k]%p);
for(n=1, s, for(k=1, n, print1(S2TMP[n, k], " ")); print())
|
|
CROSSREFS
|
A047999 (Sierpinski's triangle, Pascal's triangle mod 2)
Sequence in context: A129667 A071374 A077010 this_sequence A070887 A110242 A131364
Adjacent sequences: A166277 A166278 A166279 this_sequence A166281 A166282 A166283
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Gerald McGarvey (gerald.mcgarvey(AT)comcast.net), Oct 10 2009
|
|
|
Search completed in 0.002 seconds
|
