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!)
A340983 Number of ways to write n as an ordered sum of 10 positive cubes. 8
1, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 45, 0, 0, 0, 0, 0, 0, 120, 0, 0, 0, 0, 10, 0, 210, 0, 0, 0, 0, 90, 0, 252, 0, 0, 0, 0, 360, 0, 210, 0, 0, 0, 0, 840, 0, 120, 0, 0, 45, 0, 1260, 0, 45, 0, 0, 360, 0, 1260, 0, 20, 0, 0, 1260, 0, 840, 0, 91, 0, 0, 2520, 0, 360, 0, 360, 120, 0, 3150, 0, 90 (list; graph; refs; listen; history; text; internal format)
OFFSET
10,8
LINKS
FORMULA
G.f.: (Sum_{k>=1} x^(k^3))^10.
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, 10):
seq(a(n), n=10..92); # Alois P. Heinz, Feb 01 2021
MATHEMATICA
nmax = 92; CoefficientList[Series[Sum[x^(k^3), {k, 1, Floor[nmax^(1/3)] + 1}]^10, {x, 0, nmax}], x] // Drop[#, 10] &
CROSSREFS
Sequence in context: A270035 A228636 A306758 * A247118 A010894 A002045
KEYWORD
nonn,look
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 August 16 15:47 EDT 2024. Contains 375177 sequences. (Running on oeis4.)