login
This site is supported by donations 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. 1
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; internal format)
OFFSET

0,2

COMMENTS

Records occur at {0,1,4,21,148,1333,14664,190633,2859496,48611433,...} for n=1,2,3,..., which appears to be given by r(n+1)=(2n-1)r(n)+1. See A130147 for a related sequence.

CROSSREFS

Cf. A130147.

Sequence in context: A125958 A132448 A132450 * A070864 A076566 A083574

Adjacent sequences:  A132421 A132422 A132423 * A132425 A132426 A132427

KEYWORD

nonn

AUTHOR

John W. Layman (layman(AT)math.vt.edu), Aug 20 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 20:26 EST 2012. Contains 205852 sequences.