A161099 Number of partitions of n into squares where every part appears at least 11 times.

0, 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, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 3, 2, 2, 3, 4, 3, 3, 4, 5, 4, 4, 5, 6, 5, 5, 6, 7, 6, 6, 7, 8, 7, 7, 8, 9, 8, 8, 9, 10, 9, 9, 10, 11, 10, 10, 11, 12, 11, 11, 12, 13, 12, 12, 14, 14, 13, 13, 14, 15, 14, 14

Offset

1,44

Links

R. H. Hardin, Table of n, a(n) for n=1..1000

Formula

G.f.: Product_{k>=1} (1 + x^(11*k^2)/(1-x^(k^2))). - Vaclav Kotesovec, Jun 15 2025

Mathematica

nmax = 100; Rest[CoefficientList[Series[Product[(1 + x^(11*k^2)/(1-x^(k^2))), {k, 1, Sqrt[nmax]+1}], {x, 0, nmax}], x]] (* Vaclav Kotesovec, Jun 15 2025 *)

Crossrefs

Sequence in context: A342007 A341997 A053543 * A118663 A205119 A355150

Adjacent sequences: A161096 A161097 A161098 * A161100 A161101 A161102

Keyword

nonn

Author

R. H. Hardin, Jun 02 2009

Status

approved