|
Search: id:A114213
|
|
|
| A114213 |
|
A generalized Pascal triangle modulo 2. |
|
+0
3
|
|
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Row sums are A114212. Diagonal sums are A114214. Row sums of inverse are 0^n (conjecture).
|
|
FORMULA
|
T(n, k)=sum{j=0..n-k, C(k, j)C(n-k, j)(1+(-1)^j)/2} mod 2.
|
|
EXAMPLE
|
Triangle begins
1;
1,1;
1,1,1;
1,1,1,1;
1,1,0,1,1;
1,1,0,0,1,1;
1,1,1,0,1,1,1;
1,1,1,1,1,1,1,1;
1,1,0,1,0,1,0,1,1;
1,1,0,0,0,0,0,0,1,1;
1,1,1,0,0,0,0,0,1,1,1;
|
|
CROSSREFS
|
Sequence in context: A089829 A131217 A105567 this_sequence A108358 A144384 A144475
Adjacent sequences: A114210 A114211 A114212 this_sequence A114214 A114215 A114216
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Paul Barry (pbarry(AT)wit.ie), Nov 17 2005
|
|
|
Search completed in 0.002 seconds
|
