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 A159258 #11 Jan 08 2020 09:47:04
%S A159258 155,167,179,192,205,219,233,248,263,279,295,312,329,347,365,384,403,
%T A159258 423,443,464,485,507,529,552,575,598,622,646,671,696,722,748,775,802,
%U A159258 830,858,887,916,946,976,1007,1038,1070,1102,1135,1168,1202,1236,1271,1306
%N A159258 a(0)=155; for n > 0, a(n) = a(n-1) + floor(sqrt(a(n-1))).
%C A159258 Row 11 of square array in A159016. This sequence contains infinitely many squares.
%H A159258 G. C. Greubel, <a href="/A159258/b159258.txt">Table of n, a(n) for n = 0..5000</a>
%t A159258 RecurrenceTable[{a[n]==a[n-1] + Floor[Sqrt[a[n-1]]], a[0] == 155}, a, {n, 0, 50}] (* _G. C. Greubel_, Jun 28 2018 *)
%K A159258 nonn
%O A159258 0,1
%A A159258 _Philippe Deléham_, Apr 07 2009