VOOZH about

URL: https://oeis.org/A161098

⇱ A161098 - OEIS

login
A161098
Number of partitions of n into squares where every part appears at least 10 times.
1
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 2, 3, 2, 3, 3, 4, 3, 4, 4, 5, 4, 5, 5, 6, 5, 6, 6, 7, 6, 7, 7, 8, 7, 8, 8, 9, 8, 9, 9, 10, 9, 10, 10, 11, 10, 11, 11, 12, 11, 13, 12, 13, 12, 13, 13, 14, 13, 14, 15, 16, 15, 16, 16
OFFSET
1,40
LINKS
FORMULA
G.f.: Product_{k>=1} (1 + x^(10*k^2)/(1-x^(k^2))). - Vaclav Kotesovec, Jun 15 2025
MATHEMATICA
nmax = 100; Rest[CoefficientList[Series[Product[(1 + x^(10*k^2)/(1-x^(k^2))), {k, 1, Sqrt[nmax]+1}], {x, 0, nmax}], x]] (* Vaclav Kotesovec, Jun 15 2025 *)
CROSSREFS
Sequence in context: A330739 A076398 A086257 * A354999 A136177 A212178
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jun 02 2009
STATUS
approved