This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A086063 a(n) = if n<=1 then 1 else smallest k>1 such that in binary representation n is contained in n^k. 1
 1, 1, 2, 3, 2, 3, 3, 3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 3, 6, 3, 6, 5, 3, 3, 5, 5, 2, 3, 3, 3, 3, 2, 3, 3, 6, 3, 8, 6, 3, 3, 2, 9, 4, 5, 6, 5, 5, 3, 5, 5, 4, 5, 6, 2, 5, 3, 5, 3, 6, 3, 6, 3, 3, 2, 3, 3, 6, 3, 7, 6, 10, 3, 9, 11, 5, 7, 8, 4, 5, 3, 9, 2, 8, 9, 7, 4, 6, 5, 6, 6, 3, 5, 5, 5, 5, 3, 5, 5, 3, 5, 9, 11, 7 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS A094543(n) = n^a(n). LINKS EXAMPLE n=6: 6='110' is not contained in 6^2='100100', but in 6^3='11011000', therefore a(6)=3. CROSSREFS Cf. A045537, A007088. Sequence in context: A283617 A164886 A091935 * A145653 A266119 A026263 Adjacent sequences:  A086060 A086061 A086062 * A086064 A086065 A086066 KEYWORD nonn,base AUTHOR Reinhard Zumkeller, Aug 24 2003 EXTENSIONS Extended and corrected by Reinhard Zumkeller, May 08 2004 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.

Last modified June 25 22:16 EDT 2019. Contains 324358 sequences. (Running on oeis4.)