cp's OEIS Frontend

A025460 Number of partitions of n into 7 positive cubes.

%I A025460 #23 Nov 23 2020 08:03:23
%S A025460 0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,1,
%T A025460 0,1,0,0,0,0,1,0,1,0,0,0,0,1,0,1,0,0,0,0,1,0,1,0,0,1,0,1,0,0,0,0,1,0,
%U A025460 1,0,1,0,0,1,0,1,0,1,0,0,1,0,0,0,1,1,0,1,0,0,0,1,1,0,1,0,1,0,1,1,0,0,0,1,0,1,1,0
%N A025460 Number of partitions of n into 7 positive cubes.
%C A025460 The first term > 1 is a(131) = 2. - _Michel Marcus_, Apr 23 2019
%H A025460 Alois P. Heinz, <a href="/A025460/b025460.txt">Table of n, a(n) for n = 0..65536</a>
%H A025460 <a href="/index/Su#ssq">Index entries for sequences related to sums of cubes</a>
%F A025460 a(n) = [x^n y^7] Product_{k>=1} 1/(1 - y*x^(k^3)). - _Ilya Gutkovskiy_, Apr 23 2019
%p A025460 b:= proc(n, i, t) option remember; `if`(n=0, `if`(t=0, 1, 0),
%p A025460       `if`(i<1 or t<1, 0, b(n, i-1, t)+
%p A025460       `if`(i^3>n, 0, b(n-i^3, i, t-1))))
%p A025460     end:
%p A025460 a:= n-> b(n, iroot(n, 3), 7):
%p A025460 seq(a(n), n=0..120);  # _Alois P. Heinz_, Dec 21 2018
%t A025460 b[n_, i_, t_] := b[n, i, t] = If[n == 0, If[t == 0, 1, 0], If[i < 1 || t < 1, 0, b[n, i - 1, t] + If[i^3 > n, 0, b[n - i^3, i, t - 1]]]];
%t A025460 a[n_] := b[n, n^(1/3) // Floor, 7];
%t A025460 a /@ Range[0, 120] (* _Jean-François Alcover_, Nov 23 2020, after _Alois P. Heinz_ *)
%Y A025460 Column k=7 of A320841.
%K A025460 nonn
%O A025460 0,132
%A A025460 _David W. Wilson_
%E A025460 Second offset from _Michel Marcus_, Apr 23 2019