cp's OEIS Frontend

A348524 Number of compositions (ordered partitions) of n into two or more cubes.

%I A348524 #13 Sep 19 2022 04:53:18
%S A348524 0,0,1,1,1,1,1,1,1,3,4,5,6,7,8,9,11,14,18,23,29,36,44,53,64,78,96,119,
%T A348524 150,187,232,286,351,430,527,649,802,993,1230,1522,1880,2318,2854,
%U A348524 3514,4330,5341,6594,8145,10061,12423,15330,18908,23316,28753,35467,43762
%N A348524 Number of compositions (ordered partitions) of n into two or more cubes.
%H A348524 Robert Israel, <a href="/A348524/b348524.txt">Table of n, a(n) for n = 0..10000</a>
%H A348524 <a href="/index/Su#ssq">Index entries for sequences related to sums of cubes</a>
%p A348524 g:= proc(n) option remember;
%p A348524      local i,m,t;
%p A348524      m:= surd(n,3);
%p A348524      if m::integer then t:= 1; m:= m-1 else t:= 0; m:= floor(m) fi;
%p A348524      t + add(procname(n-i^3),i=1..m)
%p A348524 end proc:
%p A348524 f:= proc(n) local m;
%p A348524     m:= surd(n,3);
%p A348524     if m::integer then g(n)-1 else g(n) fi
%p A348524 end proc:
%p A348524 f(0):= 0:
%p A348524 map(f, [$0..100]);
%t A348524 g[n_] := g[n] = Module[{m, t}, m = n^(1/3); If[IntegerQ[m], t = 1; m = m - 1, t = 0; m = Floor[m]]; t + Sum[g[n - i^3], {i, 1, m}]];
%t A348524 f[n_] := Module[{m}, m = n^(1/3); If[IntegerQ[m], g[n]-1, g[n]]];
%t A348524 f[0] = 0;
%t A348524 Map[f, Range[0, 100]] (* _Jean-François Alcover_, Sep 19 2022, after _Robert Israel_ *)
%Y A348524 Cf. A000578, A010057, A023358, A347805, A348522.
%K A348524 nonn
%O A348524 0,10
%A A348524 _Ilya Gutkovskiy_, Oct 21 2021