|
|
A348164
|
|
Number of partitions of n such that 5*(greatest part) = (number of parts).
|
|
2
|
|
|
0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 3, 3, 5, 5, 7, 8, 10, 11, 15, 16, 20, 22, 26, 28, 35, 38, 46, 52, 62, 70, 85, 95, 112, 127, 148, 166, 195, 219, 254, 288, 332, 375, 435, 489, 562, 635, 726, 817, 936, 1051, 1198, 1348, 1531, 1721, 1957, 2196, 2489
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,17
|
|
COMMENTS
|
Also, the number of partitions of n such that (greatest part) = 5*(number of parts).
|
|
LINKS
|
|
|
FORMULA
|
G.f.: Sum_{k>=1} x^(6*k-1) * Product_{j=1..k-1} (1-x^(5*k+j-1)/(1-x^j).
|
|
EXAMPLE
|
a(19) = 3 counts these partitions:
[3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],
[3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],
[2, 2, 2, 2, 2, 2, 2, 2, 2, 1].
|
|
PROG
|
(PARI) my(N=66, x='x+O('x^N)); concat([0, 0, 0, 0], Vec(sum(k=1, N, x^(6*k-1)*prod(j=1, k-1, (1-x^(5*k+j-1))/(1-x^j)))))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|