This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A086063 #4 Mar 30 2012 18:50:37 %S A086063 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 A086063 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 A086063 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 A086063 a(n) = if n<=1 then 1 else smallest k>1 such that in binary representation n is contained in n^k. %C A086063 A094543(n) = n^a(n). %e A086063 n=6: 6='110' is not contained in 6^2='100100', but in 6^3='11011000', therefore a(6)=3. %Y A086063 Cf. A045537, A007088. %K A086063 nonn,base %O A086063 0,3 %A A086063 _Reinhard Zumkeller_, Aug 24 2003 %E A086063 Extended and corrected by _Reinhard Zumkeller_, May 08 2004