login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053423 Let g(n)=sqrt(n); the mapping F(n)=Floor(Floor(n*g(n))/Floor(g(n))) iterates to a fixed point; a(n)=least k such that f(k,n)=f(k-1,n), where f(0,n)=n, f(1,n)=F(n). 0
1, 1, 2, 1, 1, 3, 2, 9, 1, 1, 8, 7, 6, 2, 5, 1, 1, 5, 4, 3, 10, 2, 11, 9, 1, 1, 10, 9, 8, 3, 7, 2, 2, 6, 17, 1, 1, 6, 5, 4, 16, 3, 15, 12, 2, 14, 12, 11, 1, 1, 13, 12, 11, 4, 10, 3, 12, 9, 2, 13, 11, 9, 8, 1, 1, 12, 11, 10, 8, 9, 7, 3, 8, 6, 2, 2, 7, 13, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..79.

EXAMPLE

F(6)=7, F(7)=9, F(9)=9, so that a(6)=3; see A054080.

CROSSREFS

Sequence in context: A035556 A122044 A120744 * A216201 A127514 A078802

Adjacent sequences:  A053420 A053421 A053422 * A053424 A053425 A053426

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

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 June 19 11:59 EDT 2013. Contains 226404 sequences.