The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A340978 Number of ways to write n as an ordered sum of 5 positive cubes. 7
 1, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 5, 0, 5, 0, 0, 0, 0, 20, 0, 1, 0, 0, 0, 0, 30, 0, 0, 0, 0, 0, 0, 20, 0, 0, 0, 0, 10, 0, 5, 0, 0, 0, 0, 30, 0, 0, 0, 5, 0, 0, 30, 0, 0, 0, 20, 0, 0, 10, 0, 0, 0, 30, 10, 0, 0, 0, 0, 0, 20, 20, 0, 0, 0, 20, 0, 5, 10 (list; graph; refs; listen; history; text; internal format)
 OFFSET 5,8 LINKS Robert Israel, Table of n, a(n) for n = 5..10000 FORMULA G.f.: (Sum_{k>=1} x^(k^3))^5. MAPLE b:= proc(n, t) option remember;       `if`(n=0, `if`(t=0, 1, 0), `if`(t<1, 0, add((s->       `if`(s>n, 0, b(n-s, t-1)))(j^3), j=1..iroot(n, 3))))     end: a:= n-> b(n, 5): seq(a(n), n=5..97);  # Alois P. Heinz, Feb 01 2021 MATHEMATICA nmax = 97; CoefficientList[Series[Sum[x^(k^3), {k, 1, Floor[nmax^(1/3)] + 1}]^5, {x, 0, nmax}], x] // Drop[#, 5] & CROSSREFS Cf. A000578, A010057, A025458, A051344, A173679, A280618, A340977, A340979, A340980, A340981, A340982, A340983. Sequence in context: A236239 A047752 A088194 * A048894 A047766 A336881 Adjacent sequences:  A340975 A340976 A340977 * A340979 A340980 A340981 KEYWORD nonn AUTHOR Ilya Gutkovskiy, Feb 01 2021 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 April 20 23:46 EDT 2021. Contains 343143 sequences. (Running on oeis4.)