Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A027924
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A027924 a(n) = least k such that 1+2+...+k >= 1^3 + 2^3 + ... + n^3. +0
1
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; listen)
OFFSET

1,2

FORMULA

a(n)=round(sqrt(1/2)*n*(n+1)). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Jan 24 2003

PROGRAM

(PARI) for(n=1, 100, print1(round(sqrt(1/2)*n*(n+1))", ")).

CROSSREFS

Cf. A000537.

Sequence in context: A121896 A131937 A088804 this_sequence A006578 A122224 A004797

Adjacent sequences: A027921 A027922 A027923 this_sequence A027925 A027926 A027927

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

More terms from Ralf Stephan (ralf(AT)ark.in-berlin.de), Jan 24 2003

page 1

Search completed in 0.008 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 02:12 EDT 2008. Contains 142294 sequences.


AT&T Labs Research