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.

A132424 a(0)=1 and, for n>0, a(n)=a(Floor((n-1)/a[n-1]))+2.

Original entry on oeis.org

1, 3, 3, 3, 5, 3, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 7, 5, 7, 5, 7, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 5, 7, 5, 7, 5, 7, 5, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7
Offset: 0

Views

Author

John W. Layman, Aug 20 2007

Keywords

Comments

Records are 1, 3, 5, 7, 9, ... and occur at {0,1,4,21,148,1333,14664,190633,2859496,48611433,...}, which appears to be A286286.

Crossrefs

Cf. A286286.
See A130147 for a related sequence.

Programs

  • Maple
    a[0]:=1: for n from 1 to 20000 do a[n]:=2+a[floor((n-1)/a[(n-1)])] end do: # N. J. A. Sloane, May 15 2017