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

Offset: 0

Author

David W. Wilson

Keywords

• nonn

Links

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

Extensions

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