cp's OEIS Frontend

A229167 a(n) = smallest index i such that A010062(i) >= 2^n.

%I A229167 #22 Oct 12 2013 22:02:52
%S A229167 0,1,3,5,8,14,22,40,71,126,224,397,721,1318,2431,4531,8493,15999,
%T A229167 30234,57281,108744,206868,394293,752985,1440705,2761606,5302954,
%U A229167 10200322,19652438,37921447,73277740,141783308,274656312,532615214,1033834916,2008466475,3905027107
%N A229167 a(n) = smallest index i such that A010062(i) >= 2^n.
%H A229167 Donovan Johnson, <a href="/A229167/b229167.txt">Table of n, a(n) for n = 0..46</a>
%H A229167 <a href="/index/Coi#Colombian">Index entries for Colombian or self numbers and related sequences</a>
%e A229167 The first time A010062(i) is >= 16 is A010062(8) = 17, so a(4) = 8.
%p A229167 # uses wt() from A000120
%p A229167 t1:=[0]; a:=1; l:=1;
%p A229167 for i from 1 to 1000000 do
%p A229167 a:=a+wt(a);
%p A229167 if a >= 2^l then l:=l+1; t1:=[op(t1),i]; fi;
%p A229167 od:
%p A229167 t1;
%Y A229167 Cf. A000120, A010062.
%K A229167 nonn
%O A229167 0,3
%A A229167 _Patrick Devlin_ and _N. J. A. Sloane_, Sep 27 2013
%E A229167 a(24)-a(36) from _Donovan Johnson_, Sep 27 2013