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!)
A281542 Expansion of Sum_{i>=1} x^(i^2)/(1 + x^(i^2)) * Product_{j>=1} (1 + x^(j^2)). 5
1, 0, 0, 1, 2, 0, 0, 0, 1, 2, 0, 0, 2, 3, 0, 1, 2, 0, 0, 2, 3, 0, 0, 0, 3, 5, 0, 0, 5, 7, 0, 0, 0, 2, 3, 1, 2, 3, 4, 2, 5, 3, 0, 0, 5, 7, 0, 0, 4, 9, 4, 2, 5, 7, 5, 3, 4, 2, 3, 0, 5, 10, 4, 1, 11, 12, 0, 2, 6, 7, 4, 0, 2, 12, 12, 0, 6, 15, 9, 2, 8, 7, 3, 7, 8, 10, 9, 5, 8, 21, 13, 0, 7, 19, 13, 0, 2, 10, 13, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
Total number of parts in all partitions of n into distinct squares.
LINKS
FORMULA
G.f.: Sum_{i>=1} x^(i^2)/(1 + x^(i^2)) * Product_{j>=1} (1 + x^(j^2)).
From Alois P. Heinz, Feb 03 2021: (Start)
a(n) = Sum_{k>=0} k * A341040(n,k).
a(n) = 0 <=> n in { A001422 }. (End)
EXAMPLE
a(26) = 5 because we have [25, 1], [16, 9 ,1] and 2 + 3 = 5.
MATHEMATICA
nmax = 100; Rest[CoefficientList[Series[Sum[x^i^2/(1 + x^i^2), {i, 1, nmax}] Product[1 + x^j^2, {j, 1, nmax}], {x, 0, nmax}], x]]
CROSSREFS
Sequence in context: A341000 A120630 A248509 * A331844 A191410 A249142
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jan 23 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 April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)