A081882 - OEIS

%I #8 Mar 30 2012 18:39:17

%S 2,8,1,2,3,2,1,4,2,3,1,4,8,3,1,4,2,4,1,2,3,2,1,5,2,5,1,3,4,6,1,8,2,5,

%T 1,2,3,2,1,3,2,6,1,5,5,3,1,3,2,3,1,2,3,2,1,8,2,7,1,3,4,4,1,4,2,4,1,2,

%U 3,2,1,5,2,3,1,4,6,3,1,5,2,8,1,2,3,2,1,6,2,4,1,3,4,5,1,4,2,4,1,2,3,2,1,3,2

%N Number of steps needed to reach an integer starting with n-1/4 and iterating the map x ->x*ceiling(x).

%F It seems that sum(k=2, n, a(k)) is asymptotic to 3n

%o (PARI) a(n)=if(n<0,0,s=n-1/4; c=0; while(frac(s)>0,s=s*ceil(s); c++); c)

%Y Cf. A068119.

%K nonn

%O 2,1

%A _Benoit Cloitre_, Apr 13 2003