

A099238


Square array read by antidiagonals with rows generated by 1/(1xx^(k+1)).


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;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


COMMENTS

Sections of rows are given by array A099233. Sums of antidiagonals yield A097939.


LINKS

Table of n, a(n) for n=0..77.


FORMULA

Square array T(n, k)=sum{j=0..floor(n/(k+1)), binomial(nk*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: A249694 A192005 A205592 * A141450 A209690 A061462
Adjacent sequences: A099235 A099236 A099237 * A099239 A099240 A099241


KEYWORD

easy,nonn,tabl


AUTHOR

Paul Barry, Oct 08 2004


STATUS

approved



