The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A027924 a(n) = least k such that 1+2+...+k >= 1^3 + 2^3 + ... + n^3. 0
 1, 4, 8, 14, 21, 30, 40, 51, 64, 78, 93, 110, 129, 148, 170, 192, 216, 242, 269, 297, 327, 358, 390, 424, 460, 496, 535, 574, 615, 658, 701, 747, 793, 841, 891, 942, 994, 1048, 1103, 1160, 1218, 1277, 1338, 1400, 1464, 1529, 1595, 1663, 1732, 1803, 1875 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA a(n)=round(sqrt(1/2)*n*(n+1)). - Ralf Stephan, Jan 24 2003 PROG (PARI) for(n=1, 100, print1(round(sqrt(1/2)*n*(n+1))", ")). CROSSREFS Cf. A000537. Sequence in context: A183857 A088804 A344012 * A006578 A122224 A183955 Adjacent sequences:  A027921 A027922 A027923 * A027925 A027926 A027927 KEYWORD nonn AUTHOR EXTENSIONS More terms from Ralf Stephan, Jan 24 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 18 19:30 EDT 2021. Contains 347534 sequences. (Running on oeis4.)