Search: id:A008949 Results 1-1 of 1 results found. %I A008949 %S A008949 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, %T A008949 8,29,64,99,120,127,128,1,9,37,93,163,219,247,255,256,1,10,46,130,256, %U A008949 382,466,502,511,512,1,11,56,176,386,638,848,968,1013,1023,1024,1,12 %N A008949 Triangle of partial sums of binomial coefficients: T(n,k) =Sum_{i=0..k} C(n,i); also dimensions of Reed-Muller codes. %C A008949 The second-left-from-middle column is A000346: T(2n+2, n) = A000346(n). - Ed Catmur (ed(AT)catmur.co.uk), Dec 09 2006 %C A008949 T(n,k) is the maximal number of regions into which n hyperplanes of co-dimension 1 divide R^k (the Cake-Without-Icing numbers) - Rob Johnson (rob(AT)whim.org), Jul 27 2008 %D A008949 F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 376. %H A008949 T. D. Noe, Rows n=0..50 of triangle, flatten %H A008949 Rob Johnson, Dividing Space. %H A008949 Index entries for triangles and arrays related to Pascal's triangle %F A008949 Form partial sums across rows of Pascal triangle A007318. %F A008949 T(n, 0)=1, T(n, n)=2^n, T(n, k)=T(n-1, k-1)+T(n-1, k), 0