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 A186189 #17 Dec 22 2024 16:28:35 %S A186189 1,1,2,2,2,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5, %T A186189 5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, %U A186189 6,6,6,6,6,6,6,6,6,6,6,6,6,6,7,7,7,7 %N A186189 Least k such that A074286^(k)(n) = 1 where a^(k) = a(a^(k-1)). %D A186189 Benoit Cloitre, Experimental evidence for the Keane's conjecture, preprint 2011 %F A186189 Conjecture: a(n)=floor(log(n)/log(2))+0 or +1. %o A186189 (PARI) a(n)=if(n<0,0,t=n;c=1;while(A074286(t)>1,t=A074286(t);c++);c) %Y A186189 Cf. A074286. %K A186189 nonn %O A186189 1,3 %A A186189 _Benoit Cloitre_, Feb 14 2011