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 A136510 #11 Jun 06 2024 14:32:45
%S A136510 2,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,
%T A136510 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,
%U A136510 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,5
%N A136510 Smallest k>1 such that in binary representation n is contained in n^k.
%C A136510 A136511(n) = n^a(n);
%C A136510 a(A018826(n)) = 2; 1 < a(A136490(n)) <= 3;
%C A136510 conjecture: a(n) is defined for all n.
%H A136510 R. Zumkeller, <a href="/A136510/b136510.txt">Table of n, a(n) for n = 1..1000</a>
%H A136510 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%t A136510 Table[Module[{k=2},While[SequenceCount[IntegerDigits[n^k,2],IntegerDigits[ n,2]]==0,k++];k],{n,110}] (* _Harvey P. Dale_, Aug 20 2020 *)
%Y A136510 Variant of A086063.
%K A136510 nonn,base
%O A136510 1,1
%A A136510 _Reinhard Zumkeller_, Jan 03 2008