login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #4 Mar 30 2012 18:50:37

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

%T 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,

%U 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

%N a(n) = if n<=1 then 1 else smallest k>1 such that in binary representation n is contained in n^k.

%C A094543(n) = n^a(n).

%e n=6: 6='110' is not contained in 6^2='100100', but in 6^3='11011000', therefore a(6)=3.

%Y Cf. A045537, A007088.

%K nonn,base

%O 0,3

%A _Reinhard Zumkeller_, Aug 24 2003

%E Extended and corrected by _Reinhard Zumkeller_, May 08 2004

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)