|
Search: id:A008949
|
|
|
| A008949 |
|
Triangle of partial sums of binomial coefficients: T(n,k) =Sum_{i=0..k} C(n,i); also dimensions of Reed-Muller codes. |
|
+0
22
|
|
| 1, 1, 2, 1, 3, 4, 1, 4, 7, 8, 1, 5, 11, 15, 16, 1, 6, 16, 26, 31, 32, 1, 7, 22, 42, 57, 63, 64, 1, 8, 29, 64, 99, 120, 127, 128, 1, 9, 37, 93, 163, 219, 247, 255, 256, 1, 10, 46, 130, 256, 382, 466, 502, 511, 512, 1, 11, 56, 176, 386, 638, 848, 968, 1013, 1023, 1024, 1, 12
(list; table; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
The second-left-from-middle column is A000346: T(2n+2, n) = A000346(n). - Ed Catmur (ed(AT)catmur.co.uk), Dec 09 2006
|
|
REFERENCES
|
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 376.
|
|
LINKS
|
T. D. Noe, Rows n=0..50 of triangle, flatten
Index entries for triangles and arrays related to Pascal's triangle
|
|
FORMULA
|
Form partial sums across rows of Pascal triangle A007318.
T(n, 0)=1, T(n, n)=2^n, T(n, k)=T(n-1, k-1)+T(n-1, k), 0<k<n.
|
|
EXAMPLE
|
1; 1,2; 1,3,4; 1,4,7,8; ...
|
|
MAPLE
|
A008949 := proc(n, k) local i; add(binomial(n, i), i=0..n)k end;
|
|
CROSSREFS
|
Diagonals are given by A000079, A000225, A000295, A002663, A002664, A035038-A035042.
T(n, m)= A055248(n, n-m).
Cf. A110555, A007318.
Cf. A000346.
Adjacent sequences: A008946 A008947 A008948 this_sequence A008950 A008951 A008952
Sequence in context: A085643 A132110 A039912 this_sequence A076832 A078925 A072506
|
|
KEYWORD
|
tabl,nonn,easy,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Mar 23 2000
|
|
|
Search completed in 0.003 seconds
|
