The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A340982 Number of ways to write n as an ordered sum of 9 positive cubes. 8
1, 0, 0, 0, 0, 0, 0, 9, 0, 0, 0, 0, 0, 0, 36, 0, 0, 0, 0, 0, 0, 84, 0, 0, 0, 0, 9, 0, 126, 0, 0, 0, 0, 72, 0, 126, 0, 0, 0, 0, 252, 0, 84, 0, 0, 0, 0, 504, 0, 36, 0, 0, 36, 0, 630, 0, 9, 0, 0, 252, 0, 504, 0, 10, 0, 0, 756, 0, 252, 0, 72, 0, 0, 1260, 0, 72, 0, 252, 84, 0, 1260, 0, 9, 0, 504, 504 (list; graph; refs; listen; history; text; internal format)
OFFSET
9,8
LINKS
FORMULA
G.f.: (Sum_{k>=1} x^(k^3))^9.
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, 9):
seq(a(n), n=9..94); # Alois P. Heinz, Feb 01 2021
MATHEMATICA
nmax = 94; CoefficientList[Series[Sum[x^(k^3), {k, 1, Floor[nmax^(1/3)] + 1}]^9, {x, 0, nmax}], x] // Drop[#, 9] &
CROSSREFS
Sequence in context: A228635 A229660 A306757 * A334624 A036483 A353803
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 June 7 18:53 EDT 2024. Contains 373206 sequences. (Running on oeis4.)