login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A291649 Expansion of Product_{k>=1} (1 + x^(k^2))^(k^2). 7
1, 1, 0, 0, 4, 4, 0, 0, 6, 15, 9, 0, 4, 40, 36, 0, 17, 71, 90, 36, 64, 100, 180, 144, 96, 274, 394, 300, 148, 740, 820, 480, 472, 1150, 1851, 1341, 1146, 1318, 3880, 3540, 1704, 3017, 6455, 7134, 3780, 7822, 9574, 12180, 10304, 12057, 19750, 22485, 20558, 15910, 43076, 43236, 31104, 33742, 66895 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,5
COMMENTS
Number of partitions of n into distinct squares, where k^2 different parts of size k^2 are available (1a, 4a, 4b, 4c, 4d, ...).
LINKS
FORMULA
G.f.: Product_{k>=1} (1 + x^A000290(k))^A000290(k).
a(n) ~ exp(5 * 2^(-9/5) * 3^(-3/5) * (9-4*sqrt(2))^(1/5) * Pi^(1/5) * Zeta(5/2)^(2/5) * n^(3/5)) * 3^(1/5) * (2*sqrt(2)-1)^(1/5) * Zeta(5/2)^(1/5) / (2^(9/10) * sqrt(5) * Pi^(2/5) * n^(7/10)). - Vaclav Kotesovec, Aug 29 2017
EXAMPLE
a(8) = 6 because we have [4a, 4b], [4a, 4c], [4a, 4d], [4b, 4c], [4b, 4d] and [4c, 4d].
MATHEMATICA
nmax = 100; CoefficientList[Series[Product[(1 + x^k^2)^k^2, {k, 1, nmax}], {x, 0, nmax}], x]
nmax = 100; s = 1 + x; Do[s *= Sum[Binomial[k^2, j]*x^(j*k^2), {j, 0, Floor[nmax/k^2] + 1}]; s = Select[Expand[s], Exponent[#, x] <= nmax &]; , {k, 2, nmax}]; CoefficientList[s, x] (* Vaclav Kotesovec, Aug 28 2017 *)
CROSSREFS
Sequence in context: A133845 A282289 A291696 * A216060 A230278 A190113
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Aug 28 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 19 01:31 EDT 2024. Contains 374388 sequences. (Running on oeis4.)