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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087793 Least k such that S^k(n)=n^2 where S(x)=n*ceiling(sqrt(x)). 0
0, 2, 3, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

For all m>k, S^m(n)=n^2

FORMULA

a(n)=sqrt(n)+o(sqrt(n))

PROG

(PARI) a(n)=if(n<0, 0, z=1; c=0; while(abs(z-n^2)>0, z=n*ceil(sqrt(z)); c++); c)

CROSSREFS

Sequence in context: A136528 A130242 A130245 * A030411 A194817 A132913

Adjacent sequences:  A087790 A087791 A087792 * A087794 A087795 A087796

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 07 2003

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 14 22:37 EST 2012. Contains 205679 sequences.