The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A229167 a(n) = smallest index i such that A010062(i) >= 2^n. 5

%I #22 Oct 12 2013 22:02:52

%S 0,1,3,5,8,14,22,40,71,126,224,397,721,1318,2431,4531,8493,15999,

%T 30234,57281,108744,206868,394293,752985,1440705,2761606,5302954,

%U 10200322,19652438,37921447,73277740,141783308,274656312,532615214,1033834916,2008466475,3905027107

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

%H Donovan Johnson, <a href="/A229167/b229167.txt">Table of n, a(n) for n = 0..46</a>

%H <a href="/index/Coi#Colombian">Index entries for Colombian or self numbers and related sequences</a>

%e The first time A010062(i) is >= 16 is A010062(8) = 17, so a(4) = 8.

%p # uses wt() from A000120

%p t1:=[0]; a:=1; l:=1;

%p for i from 1 to 1000000 do

%p a:=a+wt(a);

%p if a >= 2^l then l:=l+1; t1:=[op(t1),i]; fi;

%p od:

%p t1;

%Y Cf. A000120, A010062.

%K nonn

%O 0,3

%A _Patrick Devlin_ and _N. J. A. Sloane_, Sep 27 2013

%E a(24)-a(36) from _Donovan Johnson_, Sep 27 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 5 04:27 EDT 2024. Contains 373102 sequences. (Running on oeis4.)