|
| |
|
|
A168656
|
|
Number of partitions of n such that the smallest part is divisible by the number of parts.
|
|
10
|
|
|
|
1, 1, 1, 2, 2, 2, 2, 3, 4, 4, 5, 6, 7, 7, 8, 10, 11, 13, 15, 18, 20, 23, 25, 29, 33, 36, 41, 47, 53, 58, 66, 74, 83, 92, 103, 116, 130, 144, 160, 179, 199, 219, 243, 269, 298, 328, 362, 399, 441, 484, 533, 586, 645, 708, 778, 854, 937, 1026, 1124, 1230, 1347, 1470, 1607, 1756, 1917, 2089
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,4
|
|
|
LINKS
|
|
|
|
FORMULA
|
G.f.: Sum_{k>=1} x^(k^2)/((1-x^(k^2)) * Product_{i=1..k-1} (1-x^i)).
|
|
|
PROG
|
(PARI)
N=100; x='x+O('x^N);
Vec( sum(k=1, sqrtint(N), x^(k^2)/(1-x^(k^2)) / prod(i=1, k-1, 1-x^i) ) )
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
easy,nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
