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

%I #15 Dec 19 2016 01:29:04

%S 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,

%T 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,

%U 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

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

%H David W. Wilson, <a href="/A025485/b025485.txt">Table of n, a(n) for n = 0..1000</a>

%K nonn

%O 0,6

%A _David W. Wilson_

%E Corrected and extended by _David W. Wilson_, Feb 28 2013