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

Offset: 0

Author

Reinhard Zumkeller, Aug 24 2003

Keywords

• nonn
• base

Comments

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

Examples

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

Crossrefs

Cf. A045537, A007088.

Extensions

Extended and corrected by Reinhard Zumkeller, May 08 2004