login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

a(1) = 1, a(n+1)= smallest cube greater than the n-th partial sum.
1

%I #12 May 01 2014 01:48:51

%S 1,8,27,64,125,343,729,1331,2744,5832,12167,24389,50653,103823,205379,

%T 421875,830584,1685159,3375000,6751269,13481272,27000000,54010152,

%U 108531333,217081801,433798093,868250664,1736654408,3477265875

%N a(1) = 1, a(n+1)= smallest cube greater than the n-th partial sum.

%p a[1] := 1:a[2] := 8:for n from 3 to 145 do a[n] := ceil(evalf((sum(a[i],i=1..n-1)+1/10^19)^(1/3),100))^3; od:seq(a[k],k=1..145);

%t Module[{c={1}},Do[AppendTo[c,Ceiling[Surd[Total[c],3]]^3],{30}];c] (* _Harvey P. Dale_, Jan 21 2013 *)

%Y Cf. A076970.

%K nonn

%O 1,2

%A _Amarnath Murthy_, Oct 21 2002

%E More terms from _Sascha Kurz_, Jan 22 2003