A159256 a(0)=131; for n > 0, a(n) = a(n-1) + floor(sqrt(a(n-1))).

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

Offset: 0

Author

Philippe Deléham, Apr 07 2009

Keywords

• nonn

Comments

Row 10 in square array A159016. This sequence contains infinitely many squares.

The squares in the sequence are (A175805(k))^2, k=0,1,2,3,... - Vincenzo Librandi, Dec 05 2010

Links

• G. C. Greubel, Table of n, a(n) for n = 0..5000

Crossrefs

Cf. A159016, A002984.

Programs

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 *)