cp's OEIS Frontend

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.

A159026 a(0)=89; a(n) = a(n-1) + floor(sqrt(a(n-1))), n > 0.

This page as a plain text file.
%I A159026 #12 Jan 08 2020 09:46:58
%S A159026 89,98,107,117,127,138,149,161,173,186,199,213,227,242,257,273,289,
%T A159026 306,323,340,358,376,395,414,434,454,475,496,518,540,563,586,610,634,
%U A159026 659,684,710,736,763,790,818,846,875,904,934,964,995,1026,1058,1090,1123,1156,1190
%N A159026 a(0)=89; a(n) = a(n-1) + floor(sqrt(a(n-1))), n > 0.
%C A159026 Row 8 in square array A159016.
%C A159026 This sequence contains infinitely many squares. - _Philippe Deléham_, Apr 04 2009
%t A159026 NestList[#+Floor[Sqrt[#]]&,89,60] (* _Harvey P. Dale_, Feb 26 2012 *)
%Y A159026 Cf. A028392, A110287.
%K A159026 nonn
%O A159026 0,1
%A A159026 _Philippe Deléham_, Apr 02 2009
%E A159026 More terms from _Vincenzo Librandi_, Apr 10 2009