login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A186189 least k such that A074286^(k)(n)=1 where a^(k)=a(a^(k-1)). 0

%I

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

%N least k such that A074286^(k)(n)=1 where a^(k)=a(a^(k-1)).

%D B. Cloitre, Experimental evidence for the Keane's conjecture, preprint 2011

%F conjecture: a(n)=floor(log(n)/log(2))+0 or +1

%o a(n)=if(n<0,0,t=n;c=1;while(A074286(t)>1,t=A074286(t);c++);c)

%K nonn

%O 1,3

%A _Benoit Cloitre_, Feb 14 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 18 17:10 EDT 2021. Contains 345120 sequences. (Running on oeis4.)