Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
A340977
Number of ways to write n as an ordered sum of 4 positive cubes.
9
1, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 4, 0, 1, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 12, 0, 0, 0, 4, 0, 0, 6, 0, 0, 0, 12, 0, 0, 0, 0, 0, 0, 12, 4, 0, 0, 0, 0, 0, 4, 4, 0, 0, 0, 12, 0, 0, 0, 0, 0, 0, 24
OFFSET
4,8
FORMULA
G.f.: (Sum_{k>=1} x^(k^3))^4.
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, 4):
seq(a(n), n=4..100); # Alois P. Heinz, Feb 01 2021
MATHEMATICA
nmax = 100; CoefficientList[Series[Sum[x^(k^3), {k, 1, Floor[nmax^(1/3)] + 1}]^4, {x, 0, nmax}], x] // Drop[#, 4] &
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Feb 01 2021
STATUS
approved