A051343 Number of ways of writing n as a sum of 3 nonnegative cubes (counted naively).

1, 3, 3, 1, 0, 0, 0, 0, 3, 6, 3, 0, 0, 0, 0, 0, 3, 3, 0, 0, 0, 0, 0, 0, 1, 0, 0, 3, 6, 3, 0, 0, 0, 0, 0, 6, 6, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 0, 0, 0, 0, 0, 0, 3, 0, 3, 6, 3, 0, 0, 0, 0, 0, 6, 6, 0, 0, 0, 0, 0, 0, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 6

Offset: 0

Author

N. J. A. Sloane

Keywords

• nonn
• easy

Links

• Charles R Greathouse IV, Table of n, a(n) for n = 0..10000

Crossrefs

Cf. A051344.

Sums of k cubes, number of ways of writing n as, for k=1..9: A010057, A173677, A051343, A173678, A173679, A173680, A173676, A173681, A173682.

Programs

Maple

series(add(x^(n^3), n=0..10)^3,x,1000);

PARI

first(n)=my(s=vector(n+1)); for(k=0,sqrtnint(n,3), s[k^3+1]=1); Vec(Ser(s,,n+1)^3) \\ Charles R Greathouse IV, Sep 16 2016