login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 28 00:45 EDT 2024. Contains 374674 sequences. (Running on oeis4.)