|
|
A159256
|
|
a(0)=131; for n > 0, a(n) = a(n-1) + floor(sqrt(a(n-1))).
|
|
2
|
|
|
131, 142, 153, 165, 177, 190, 203, 217, 231, 246, 261, 277, 293, 310, 327, 345, 363, 382, 401, 421, 441, 462, 483, 504, 526, 548, 571, 594, 618, 642, 667, 692, 718, 744, 771, 798, 826, 854, 883, 912, 942, 972, 1003, 1034, 1066, 1098, 1131, 1164, 1198
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
Row 10 in square array A159016. This sequence contains infinitely many squares.
|
|
LINKS
|
|
|
MATHEMATICA
|
RecurrenceTable[{a[0]==131, a[n]==a[n-1]+Floor[Sqrt[a[n-1]]]}, a, {n, 50}] (* Harvey P. Dale, Apr 17 2013 *)
NestList[#+Floor[Sqrt[#]]&, 131, 50] (* Harvey P. Dale, May 11 2019 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|