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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025485 Number of iterations of function f(n) = ceil(sqrt(n))^2 - k on n required to force n <= 2. 0
0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 2, 2, 1, 1, 0, 0, 0, 1, 1, 2, 2, 1, 1, 0, 0, 0, 3, 1, 1, 1, 2, 2, 1, 1, 0, 0, 0, 2, 3, 3, 1, 1, 1, 2, 2, 1, 1, 0, 0, 0, 1, 2, 2, 3, 3, 1, 1, 1, 2, 2, 1, 1, 0, 0, 0, 1, 1, 1, 2, 2, 3, 3, 1, 1, 1, 2, 2, 1, 1, 0, 0, 0, 2, 2, 1, 1, 1, 2, 2, 3, 3, 1, 1, 1, 2, 2, 1, 1, 0, 0, 0, 3, 3, 2, 2, 1, 1, 1 (list; graph; refs; listen; history; internal format)
OFFSET

0,11

CROSSREFS

Sequence in context: A083747 A049334 A054924 * A046751 A124478 A030353

Adjacent sequences:  A025482 A025483 A025484 * A025486 A025487 A025488

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

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 17 16:49 EST 2012. Contains 206058 sequences.