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 A186188 #7 Mar 30 2012 18:39:28 %S A186188 1,1,1,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5, %T A186188 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,6,6,6,6, %U A186188 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6 %N A186188 Least k such that A156077^(k)(n)=1 where a^(k)=a(a^(k-1)). %D A186188 B. Cloitre, Experimental evidence for the Keane's conjecture, preprint 2011 %F A186188 conjecture: a(n)=floor(log(n)/log(2))+0 or +1 %o A186188 (PARI) a(n)=if(n<0,0,t=n;c=1;while(A156077(t)>1,t=A156077(t);c++);c) %Y A186188 Cf. A000002, A156077. %K A186188 nonn %O A186188 1,4 %A A186188 _Benoit Cloitre_, Feb 14 2011