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 A159256 #19 Jan 08 2020 09:47:09
%S A159256 131,142,153,165,177,190,203,217,231,246,261,277,293,310,327,345,363,
%T A159256 382,401,421,441,462,483,504,526,548,571,594,618,642,667,692,718,744,
%U A159256 771,798,826,854,883,912,942,972,1003,1034,1066,1098,1131,1164,1198
%N A159256 a(0)=131; for n > 0, a(n) = a(n-1) + floor(sqrt(a(n-1))).
%C A159256 Row 10 in square array A159016. This sequence contains infinitely many squares.
%C A159256 The squares in the sequence are (A175805(k))^2, k=0,1,2,3,... - _Vincenzo Librandi_, Dec 05 2010
%H A159256 G. C. Greubel, <a href="/A159256/b159256.txt">Table of n, a(n) for n = 0..5000</a>
%t A159256 RecurrenceTable[{a[0]==131,a[n]==a[n-1]+Floor[Sqrt[a[n-1]]]},a,{n,50}] (* _Harvey P. Dale_, Apr 17 2013 *)
%t A159256 NestList[#+Floor[Sqrt[#]]&,131,50] (* _Harvey P. Dale_, May 11 2019 *)
%Y A159256 Cf. A159016, A002984.
%K A159256 nonn
%O A159256 0,1
%A A159256 _Philippe Deléham_, Apr 07 2009