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.

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

Original entry on oeis.org

209, 223, 237, 252, 267, 283, 299, 316, 333, 351, 369, 388, 407, 427, 447, 468, 489, 511, 533, 556, 579, 603, 627, 652, 677, 703, 729, 756, 783, 810, 838, 866, 895, 924, 954, 984, 1015, 1046, 1078, 1110, 1143, 1176, 1210, 1244, 1279, 1314, 1350, 1386
Offset: 0

Views

Author

Philippe Deléham, Apr 07 2009

Keywords

Comments

Row 13 in square array A159016. This sequence contains infinitely many squares.
The squares in the sequence are (A175806(k))^2, k = 0,1,2,... [Vincenzo Librandi, Dec 05 2010]

Crossrefs

Programs

  • Magma
    [n eq 1 select 209 else Self(n-1)+Floor(Sqrt (Self(n-1))):n in [1..30]]; // Marius A. Burtea, Jan 07 2020
  • Mathematica
    NestList[#+Floor[Sqrt[#]]&,209,50] (* Harvey P. Dale, Jun 12 2017 *)