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

A086063

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

Terms

    a(0) =1a(1) =1a(2) =2a(3) =3a(4) =2a(5) =3a(6) =3a(7) =3a(8) =2a(9) =3a(10) =3a(11) =5a(12) =3a(13) =4a(14) =3a(15) =3a(16) =2a(17) =3a(18) =3a(19) =6a(20) =3a(21) =6a(22) =5a(23) =3a(24) =3a(25) =5a(26) =5a(27) =2a(28) =3a(29) =3

External references