A340982 - OEIS

A340982

Number of ways to write n as an ordered sum of 9 positive cubes.

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

Robert Israel, Table of n, a(n) for n = 9..10000

Index entries for sequences related to sums of cubes

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))))