cp's OEIS Frontend

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.

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

Original entry on oeis.org

0, 1, 3, 5, 8, 14, 22, 40, 71, 126, 224, 397, 721, 1318, 2431, 4531, 8493, 15999, 30234, 57281, 108744, 206868, 394293, 752985, 1440705, 2761606, 5302954, 10200322, 19652438, 37921447, 73277740, 141783308, 274656312, 532615214, 1033834916, 2008466475, 3905027107
Offset: 0

Views

Author

Patrick Devlin and N. J. A. Sloane, Sep 27 2013

Keywords

Examples

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

Crossrefs

Programs

  • Maple
    # uses wt() from A000120
    t1:=[0]; a:=1; l:=1;
    for i from 1 to 1000000 do
    a:=a+wt(a);
    if a >= 2^l then l:=l+1; t1:=[op(t1),i]; fi;
    od:
    t1;

Extensions

a(24)-a(36) from Donovan Johnson, Sep 27 2013