A340980 Number of ways to write n as an ordered sum of 7 positive cubes.
1, 0, 0, 0, 0, 0, 0, 7, 0, 0, 0, 0, 0, 0, 21, 0, 0, 0, 0, 0, 0, 35, 0, 0, 0, 0, 7, 0, 35, 0, 0, 0, 0, 42, 0, 21, 0, 0, 0, 0, 105, 0, 7, 0, 0, 0, 0, 140, 0, 1, 0, 0, 21, 0, 105, 0, 0, 0, 0, 105, 0, 42, 0, 7, 0, 0, 210, 0, 7, 0, 42, 0, 0, 210, 0, 0, 0, 105, 35, 0, 105, 0, 0, 0, 140, 140, 0, 21, 0, 42
Offset: 7
Keywords
Links
Crossrefs
Programs
-
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, 7): seq(a(n), n=7..96); # Alois P. Heinz, Feb 01 2021
-
Mathematica
nmax = 96; CoefficientList[Series[Sum[x^(k^3), {k, 1, Floor[nmax^(1/3)] + 1}]^7, {x, 0, nmax}], x] // Drop[#, 7] &
Formula
G.f.: (Sum_{k>=1} x^(k^3))^7.