This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A281669 Expansion of Sum_{i>=1} x^(i^3)/(1 + x^(i^3)) * Product_{j>=1} (1 + x^(j^3)). 0
 1, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 0, 2, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 0, 2, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 0, 0, 0, 0, 0, 0, 3, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,9 COMMENTS Total number of parts in all partitions of n into distinct cubes. LINKS FORMULA G.f.: Sum_{i>=1} x^(i^3)/(1 + x^(i^3)) * Product_{j>=1} (1 + x^(j^3)). EXAMPLE a(36) = 3 because we have [27, 8, 1]. MATHEMATICA nmax = 100; Rest[CoefficientList[Series[Sum[x^i^3/(1 + x^i^3), {i, 1, nmax}] Product[1 + x^j^3, {j, 1, nmax}], {x, 0, nmax}], x]] CROSSREFS Cf. A000578, A015723, A279329, A281542, A281613. Sequence in context: A130706 A000038 A228594 * A014083 A238403 A112315 Adjacent sequences:  A281666 A281667 A281668 * A281670 A281671 A281672 KEYWORD nonn AUTHOR Ilya Gutkovskiy, Jan 26 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 7 00:41 EST 2019. Contains 329816 sequences. (Running on oeis4.)