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.

A159258 a(0)=155; for n > 0, a(n) = a(n-1) + floor(sqrt(a(n-1))).

Original entry on oeis.org

155, 167, 179, 192, 205, 219, 233, 248, 263, 279, 295, 312, 329, 347, 365, 384, 403, 423, 443, 464, 485, 507, 529, 552, 575, 598, 622, 646, 671, 696, 722, 748, 775, 802, 830, 858, 887, 916, 946, 976, 1007, 1038, 1070, 1102, 1135, 1168, 1202, 1236, 1271, 1306
Offset: 0

Views

Author

Philippe Deléham, Apr 07 2009

Keywords

Comments

Row 11 of square array in A159016. This sequence contains infinitely many squares.

Programs

  • Mathematica
    RecurrenceTable[{a[n]==a[n-1] + Floor[Sqrt[a[n-1]]], a[0] == 155}, a, {n, 0, 50}] (* G. C. Greubel, Jun 28 2018 *)