This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A159022 #15 Jan 08 2020 09:46:22 %S A159022 29,34,39,45,51,58,65,73,81,90,99,108,118,128,139,150,162,174,187,200, %T A159022 214,228,243,258,274,290,307,324,342,360,378,397,416,436,456,477,498, %U A159022 520,542,565,588,612,636,661,686,712,738,765,792,820,848,877,906,936,966,997,1028 %N A159022 a(0)=29; a(n) = a(n-1) + floor(sqrt(a(n-1))), n > 0. %C A159022 Row 4 in square array A159016. %C A159022 This sequence contains infinitely many squares. - _Philippe Deléham_, Apr 04 2009 %C A159022 There are 10 squares in the first 10000 terms. - _Harvey P. Dale_, Aug 26 2019 %H A159022 Harvey P. Dale, <a href="/A159022/b159022.txt">Table of n, a(n) for n = 0..1000</a> %t A159022 NestList[#+Floor[Sqrt[#]]&,29,60] (* _Harvey P. Dale_, Aug 26 2019 *) %Y A159022 Cf. A028392, A005010. %K A159022 nonn %O A159022 0,1 %A A159022 _Philippe Deléham_, Apr 02 2009 %E A159022 More terms from _Vincenzo Librandi_, Apr 10 2009