This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A081882 #8 Mar 30 2012 18:39:17 %S A081882 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 A081882 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 A081882 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 A081882 Number of steps needed to reach an integer starting with n-1/4 and iterating the map x ->x*ceiling(x). %F A081882 It seems that sum(k=2, n, a(k)) is asymptotic to 3n %o A081882 (PARI) a(n)=if(n<0,0,s=n-1/4; c=0; while(frac(s)>0,s=s*ceil(s); c++); c) %Y A081882 Cf. A068119. %K A081882 nonn %O A081882 2,1 %A A081882 _Benoit Cloitre_, Apr 13 2003