OFFSET
0,9
COMMENTS
In general, for m>=1, if g.f. = Sum_{k>=0} x^((m+1)*k) / Product_{j=1..m*k} (1 - x^j), then a(n) ~ Gamma(1/m) * Pi^(1/m) * exp(Pi*sqrt(2*n/3)) / (m^2 * 2^((4*m+1)/(2*m)) * 3^((m+1)/(2*m)) * n^(1 + 1/(2*m))). - Vaclav Kotesovec, Jun 19 2025
LINKS
Vaclav Kotesovec, Table of n, a(n) for n = 0..5000 (terms 0..1000 from Seiichi Manyama)
FORMULA
G.f.: Sum_{k>=0} x^(6*k)/Product_{j=1..5*k} (1-x^j).
a(n) ~ Gamma(1/5) * Pi^(1/5) * exp(Pi*sqrt(2*n/3)) / (25 * 2^(21/10) * 3^(3/5) * n^(11/10)). - Vaclav Kotesovec, Jun 19 2025
EXAMPLE
a(8) = 2 counts these partitions: 521, 5111.
MATHEMATICA
nmax = 60; CoefficientList[Series[Sum[x^(6*k)/Product[1 - x^j, {j, 1, 5*k}], {k, 0, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Jun 18 2025 *)
nmax = 60; p=1; s=1; Do[p=Expand[p*(1-x^(5*k))*(1-x^(5*k-1))*(1-x^(5*k-2))*(1-x^(5*k-3))*(1-x^(5*k-4))]; p=Take[p, Min[nmax+1, Exponent[p, x]+1, Length[p]]]; s+=x^(6*k)/p; , {k, 1, nmax}]; CoefficientList[Series[s, {x, 0, nmax}], x] (* Vaclav Kotesovec, Jun 18 2025 *)
PROG
(PARI) a(n) = sum(k=0, n\6, #partitions(n-6*k, 5*k));
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, May 16 2023
STATUS
approved
