login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132424 a(0)=1 and, for n>0, a(n)=a(Floor((n-1)/a[n-1]))+2. 4
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
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.
LINKS
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
CROSSREFS
Cf. A286286.
See A130147 for a related sequence.
Sequence in context: A344186 A132448 A132450 * A070864 A321790 A076566
KEYWORD
nonn
AUTHOR
John W. Layman, Aug 20 2007
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)