|
|
A046775
|
|
Number of partitions of n with equal number of parts congruent to each of 1, 2, 3 and 4 (mod 5).
|
|
2
|
|
|
1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 3, 0, 0, 0, 0, 8, 0, 0, 0, 0, 22, 0, 0, 0, 0, 53, 0, 0, 0, 0, 124, 0, 0, 0, 0, 269, 0, 0, 0, 0, 568, 0, 0, 0, 0, 1152, 0, 0, 0, 0, 2284, 0, 0, 0, 0, 4410, 0, 0, 0, 0, 8363, 0, 0, 0, 0, 15542, 0, 0, 0, 0, 28438, 0, 0, 0, 0, 51201, 0, 0, 0, 0, 90930, 0, 0, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,11
|
|
LINKS
|
|
|
FORMULA
|
G.f.: (Sum_{k>=0} x^(10*k)/(Product_{j=1..k} 1 - x^(5*j))^3)/(Product_{j>=0} 1 - x^(5*j+5)). - Andrew Howroyd, Sep 16 2019
|
|
PROG
|
(PARI) seq(n)={Vec(sum(k=0, n\10, x^(10*k)/prod(j=1, k, 1 - x^(5*j) + O(x*x^n))^4)/prod(j=0, n\5, 1 - x^(5*j+5) + O(x*x^n)))} \\ Andrew Howroyd, Sep 16 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|