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.

A159022 a(0)=29; a(n) = a(n-1) + floor(sqrt(a(n-1))), n > 0.

Original entry on oeis.org

29, 34, 39, 45, 51, 58, 65, 73, 81, 90, 99, 108, 118, 128, 139, 150, 162, 174, 187, 200, 214, 228, 243, 258, 274, 290, 307, 324, 342, 360, 378, 397, 416, 436, 456, 477, 498, 520, 542, 565, 588, 612, 636, 661, 686, 712, 738, 765, 792, 820, 848, 877, 906, 936, 966, 997, 1028
Offset: 0

Views

Author

Philippe Deléham, Apr 02 2009

Keywords

Comments

Row 4 in square array A159016.
This sequence contains infinitely many squares. - Philippe Deléham, Apr 04 2009
There are 10 squares in the first 10000 terms. - Harvey P. Dale, Aug 26 2019

Crossrefs

Programs

  • Mathematica
    NestList[#+Floor[Sqrt[#]]&,29,60] (* Harvey P. Dale, Aug 26 2019 *)

Extensions

More terms from Vincenzo Librandi, Apr 10 2009