|
|
A002984
|
|
a(0) = 1; for n > 0, a(n) = a(n-1) + floor(sqrt(a(n-1))).
(Formerly M0554)
|
|
9
|
|
|
1, 2, 3, 4, 6, 8, 10, 13, 16, 20, 24, 28, 33, 38, 44, 50, 57, 64, 72, 80, 88, 97, 106, 116, 126, 137, 148, 160, 172, 185, 198, 212, 226, 241, 256, 272, 288, 304, 321, 338, 356, 374, 393, 412, 432, 452, 473, 494, 516, 538, 561, 584, 608, 632, 657, 682, 708, 734
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
For n > 3 we have a(n) < n^2/4; for n > 44 we have a(n) > n^2/5. - Stefan Steinerberger, Apr 17 2006
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
NestList[ # + Floor[ Sqrt[ # ] ] &, 1, 50 ]
|
|
PROG
|
(Haskell)
a002984 n = a002984_list !! n
a002984_list = iterate (\x -> x + a000196 x) 1
(Magma) [n le 0 select 1 else Self(n)+Floor(Sqrt(Self(n))): n in [0..60]]; // Bruno Berselli, Feb 15 2013
|
|
CROSSREFS
|
Cf. A000302 (subsequence of squares).
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Dec 14 2000
|
|
STATUS
|
approved
|
|
|
|