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 A159263 #11 Jan 07 2020 18:11:55
%S A159263 181,194,207,221,235,250,265,281,297,314,331,349,367,386,405,425,445,
%T A159263 466,487,509,531,554,577,601,625,650,675,700,726,752,779,806,834,862,
%U A159263 891,920,950,980,1011,1042,1074,1106,1139,1172,1206,1240,1275,1310,1346
%N A159263 a(0)=181; for n > 0, a(n) = a(n-1) + floor(sqrt a(n-1)).
%C A159263 Row 12 in square array A159016. This sequence contains infinitely many squares.
%H A159263 G. C. Greubel, <a href="/A159263/b159263.txt">Table of n, a(n) for n = 0..5000</a>
%t A159263 RecurrenceTable[{a[n]==a[n-1] + Floor[Sqrt[a[n-1]]], a[0] == 181}, a, {n, 0, 50}] (* _G. C. Greubel_, Jun 28 2018 *)
%Y A159263 Cf. A159016.
%K A159263 nonn
%O A159263 0,1
%A A159263 _Philippe Deléham_, Apr 07 2009