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!)
A340978 Number of ways to write n as an ordered sum of 5 positive cubes. 9
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
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
Sequence in context: A236239 A047752 A088194 * A048894 A047766 A336881
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 12 15:35 EDT 2024. Contains 372482 sequences. (Running on oeis4.)