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!)
A186188 Least k such that A156077^(k)(n)=1 where a^(k)=a(a^(k-1)). 0
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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

REFERENCES

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

LINKS

Table of n, a(n) for n=1..86.

FORMULA

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

PROG

(PARI) a(n)=if(n<0, 0, t=n; c=1; while(A156077(t)>1, t=A156077(t); c++); c)

CROSSREFS

Cf. A000002, A156077.

Sequence in context: A130255 A082527 A294235 * A227177 A132944 A210568

Adjacent sequences:  A186185 A186186 A186187 * A186189 A186190 A186191

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Feb 14 2011

STATUS

approved

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 May 14 22:10 EDT 2021. Contains 343903 sequences. (Running on oeis4.)