|
|
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
|
See A130147 for a related sequence.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|