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.

A159024 a(0)=55; a(n) = a(n-1) + floor(sqrt(a(n-1))), n > 0.

This page as a plain text file.
%I A159024 #11 Nov 27 2022 15:50:15
%S A159024 55,62,69,77,85,94,103,113,123,134,145,157,169,182,195,208,222,236,
%T A159024 251,266,282,298,315,332,350,368,387,406,426,446,467,488,510,532,555,
%U A159024 578,602,626,651,676,702,728,754,781,808,836,864,893,922,952,982,1013,1044
%N A159024 a(0)=55; a(n) = a(n-1) + floor(sqrt(a(n-1))), n > 0.
%C A159024 Row 6 in square array A159016.
%C A159024 This sequence contains infinitely many squares. - _Philippe Deléham_, Apr 04 2009
%t A159024 NestList[#+Floor[Sqrt[#]]&,55,60] (* _Harvey P. Dale_, Nov 27 2022 *)
%Y A159024 Cf. A028392, A005029.
%K A159024 nonn
%O A159024 0,1
%A A159024 _Philippe Deléham_, Apr 02 2009
%E A159024 More terms from _Vincenzo Librandi_, Apr 10 2009