login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A076969
a(1) = 1, a(n+1)= smallest cube greater than the n-th partial sum.
1
1, 8, 27, 64, 125, 343, 729, 1331, 2744, 5832, 12167, 24389, 50653, 103823, 205379, 421875, 830584, 1685159, 3375000, 6751269, 13481272, 27000000, 54010152, 108531333, 217081801, 433798093, 868250664, 1736654408, 3477265875
OFFSET
1,2
MAPLE
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);
MATHEMATICA
Module[{c={1}}, Do[AppendTo[c, Ceiling[Surd[Total[c], 3]]^3], {30}]; c] (* Harvey P. Dale, Jan 21 2013 *)
CROSSREFS
Cf. A076970.
Sequence in context: A030289 A111131 A111103 * A179163 A050462 A112662
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Oct 21 2002
EXTENSIONS
More terms from Sascha Kurz, Jan 22 2003
STATUS
approved