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.

A159023 a(0)=41; a(n) = a(n-1) + floor(sqrt(a(n-1))), n > 0.

This page as a plain text file.
%I A159023 #16 Jan 08 2020 09:46:28
%S A159023 41,47,53,60,67,75,83,92,101,111,121,132,143,154,166,178,191,204,218,
%T A159023 232,247,262,278,294,311,328,346,364,383,402,422,442,463,484,506,528,
%U A159023 550,573,596,620,644,669,694,720,746,773,800,828,856,885,914,944,974,1005,1036
%N A159023 a(0)=41; a(n) = a(n-1) + floor(sqrt(a(n-1))), n > 0.
%C A159023 Row 5 in square array A159016.
%C A159023 This sequence contains infinitely many squares. - _Philippe Deléham_, Apr 04 2009
%t A159023 NestList[#+Floor[Sqrt[#]]&,41,60] (* _Harvey P. Dale_, Nov 06 2011 *)
%Y A159023 Cf. A028392
%K A159023 nonn
%O A159023 0,1
%A A159023 _Philippe Deléham_, Apr 02 2009
%E A159023 More terms from _Vincenzo Librandi_, Apr 10 2009
%E A159023 Error in sequence corrected by _Jon E. Schoenfield_, Jun 23 2010