|
| |
|
|
A152977
|
|
Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of partitions of 2^n into powers of 2 less than or equal to 2^k.
|
|
1
| |
|
|
1, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 2, 4, 5, 1, 1, 2, 4, 9, 9, 1, 1, 2, 4, 10, 25, 17, 1, 1, 2, 4, 10, 35, 81, 33, 1, 1, 2, 4, 10, 36, 165, 289, 65, 1, 1, 2, 4, 10, 36, 201, 969, 1089, 129, 1, 1, 2, 4, 10, 36, 202, 1625, 6545, 4225, 257, 1, 1, 2, 4, 10, 36, 202, 1827, 17361, 47905, 16641, 513, 1
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,5
|
|
|
COMMENTS
| Column sequences converge towards A002577.
|
|
|
LINKS
| Alois P. Heinz, Table of n, a(n) for n = 0..10010
|
|
|
FORMULA
| A(n,k) = [x^2^(n-1)] 1/(1-x) * 1/Product_{j=0..k-1} (1-x^(2^j)) for n>1; A(0,k) = 1.
|
|
|
EXAMPLE
| A(3,2) = 9, because there are 9 partitions of 2^3=8 into powers of 2 less than or equal to 2^2=4: [4,4], [4,2,2], [4,2,1,1], [4,1,1,1,1], [2,2,2,2], [2,2,2,1,1], [2,2,1,1,1,1], [2,1,1,1,1,1,1], [1,1,1,1,1,1,1,1].
Square array A(n,k) begins:
1, 1, 1, 1, 1, 1, ...
1, 2, 2, 2, 2, 2, ...
1, 3, 4, 4, 4, 4, ...
1, 5, 9, 10, 10, 10, ...
1, 9, 25, 35, 36, 36, ...
1, 17, 81, 165, 201, 202, ...
|
|
|
MAPLE
| b:= proc(n, j) local nn, r;
if n<0 then 0
elif j=0 then 1
elif j=1 then n+1
elif n<j then b(n, j):= b(n-1, j) +b(2*n, j-1)
else nn:= 1 +floor(n);
r:= n-nn;
(nn-j) *binomial(nn, j) *add (binomial(j, h)
/(nn-j+h) *b(j-h+r, j) *(-1)^h, h=0..j-1)
fi
end:
A:= (n, k)-> `if` (n=0, 1, b(2^(n-k), k)):
seq (seq (A(n, d-n), n=0..d), d=0..11);
|
|
|
CROSSREFS
| Columns k=0-2 give: A000012, A094373, A028400(n-2) for n>1.
Cf. A002577, A000123, A181322, A145515.
Sequence in context: A199711 A048887 A047913 * A117935 A179749 A103462
Adjacent sequences: A152974 A152975 A152976 * A152978 A152979 A152980
|
|
|
KEYWORD
| nonn,tabl
|
|
|
AUTHOR
| Alois P. Heinz (heinz(AT)hs-heilbronn.de), Jan 26 2011
|
| |
|
|
