A025485 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A025485

Number of iterations of function f(k) = ceiling(sqrt(k))^2 - k on n required to force n <= 2.

0, 0, 0, 1, 1, 2, 2, 1, 1, 1, 3, 3, 2, 2, 1, 1, 1, 2, 2, 3, 3, 2, 2, 1, 1, 1, 4, 2, 2, 2, 3, 3, 2, 2, 1, 1, 1, 3, 4, 4, 2, 2, 2, 3, 3, 2, 2, 1, 1, 1, 2, 3, 3, 4, 4, 2, 2, 2, 3, 3, 2, 2, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 2, 2, 2, 3, 3, 2, 2, 1, 1, 1, 3, 3, 2, 2, 2, 3, 3, 4, 4, 2, 2, 2, 3, 3, 2, 2, 1, 1, 1, 4, 4, 3, 3, 2, 2, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,6

LINKS

David W. Wilson, Table of n, a(n) for n = 0..1000

CROSSREFS

Sequence in context: A275648 A201881 A291120 * A219365 A140751 A259922

Adjacent sequences: A025482 A025483 A025484 * A025486 A025487 A025488

KEYWORD

nonn

AUTHOR

David W. Wilson

EXTENSIONS

Corrected and extended by David W. Wilson, Feb 28 2013

STATUS

approved