login
A262289
a(n) = smallest positive number, not a power of 2, that is not a substring of n in its binary representation.
3
3, 3, 3, 5, 3, 3, 5, 5, 3, 3, 3, 6, 5, 7, 5, 5, 3, 3, 3, 5, 3, 3, 7, 6, 5, 5, 7, 7, 5, 9, 5, 5, 3, 3, 3, 5, 3, 3, 5, 5, 3, 3, 3, 6, 7, 7, 9, 6, 5, 5, 5, 5, 7, 7, 7, 9, 5, 5, 9, 9, 5, 9, 5, 5, 3, 3, 3, 5, 3, 3, 5, 5, 3, 3, 3, 6, 5, 7, 5, 5, 3, 3, 3, 6, 3, 3, 7
OFFSET
0,1
COMMENTS
Similar to A261461, but if the smallest missing number is a power of 2, ignore it and look at the next-smallest missing number.
LINKS
David Consiglio, Jr., Python Program
MATHEMATICA
fQ[m_, n_] := Block[{g}, g[x_] := ToString@FromDigits@IntegerDigits[x, 2]; StringContainsQ[g@ n, g@ m]]; Table[k = 3; While[Or[fQ[k, n] && k < 2 n, IntegerQ@ Log[2, k]], k++]; k, {n, 0, 86}] (* Michael De Vlieger, Sep 21 2015 *)
CROSSREFS
See A262281 for the "nonnegative" version.
Sequence in context: A103153 A162022 A318240 * A096918 A075018 A324974
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Sep 19 2015
EXTENSIONS
a(23)-a(86) from Hiroaki Yamanouchi, Sep 20 2015
STATUS
approved