login
A161097
Number of partitions of n into squares where every part appears at least 9 times.
1
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, 2, 1, 1, 1, 2, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 11, 12, 11, 11, 12, 12, 12, 12, 13, 13, 15, 14, 15, 15, 15, 15, 16, 16, 16, 18, 18, 18
OFFSET
1,36
LINKS
FORMULA
G.f.: Product_{k>=1} (1 + x^(9*k^2)/(1-x^(k^2))). - Vaclav Kotesovec, Jun 15 2025
MATHEMATICA
nmax = 100; Rest[CoefficientList[Series[Product[(1 + x^(9*k^2)/(1-x^(k^2))), {k, 1, Sqrt[nmax]+1}], {x, 0, nmax}], x]] (* Vaclav Kotesovec, Jun 15 2025 *)
CROSSREFS
Sequence in context: A033183 A351742 A090677 * A105240 A327499 A353693
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jun 02 2009
STATUS
approved