|
Search: id:A099238
|
|
|
| A099238 |
|
Square array read by anti-diagonals with rows generated by 1/(1-x-x^(k+1)). |
|
+0
4
|
|
| 1, 1, 2, 1, 1, 4, 1, 1, 2, 8, 1, 1, 1, 3, 16, 1, 1, 1, 2, 5, 32, 1, 1, 1, 1, 3, 8, 64, 1, 1, 1, 1, 2, 4, 13, 128, 1, 1, 1, 1, 1, 3, 6, 21, 256, 1, 1, 1, 1, 1, 2, 4, 9, 34, 512, 1, 1, 1, 1, 1, 1, 3, 5, 13, 55, 1024, 1, 1, 1, 1, 1, 1, 2, 4, 7, 19, 89, 2048
(list; table; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Sections of rows are given by array A099233. Sums of anti-diagonals yield A097939.
|
|
FORMULA
|
Square array T(n, k)=sum{j=0..floor(n/(k+1)), binomial(n-k*j, j)}, n, k>=0.
|
|
EXAMPLE
|
Rows begin
1,2,4,8,16,32,.. (A000079)
1,1,2,3,5,8,13,... (A000045)
1,1,1,2,3,4,6,9,... (A000930)
1,1,1,1,2,3,4,5,7,.. (A003269)
1,1,1,1,1,2,3,4,5,.. (A003520)
|
|
CROSSREFS
|
Sequence in context: A136674 A064645 A008307 this_sequence A061462 A122578 A005131
Adjacent sequences: A099235 A099236 A099237 this_sequence A099239 A099240 A099241
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Paul Barry (pbarry(AT)wit.ie), Oct 08 2004
|
|
|
Search completed in 0.002 seconds
|
