login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A261461 a(n) = smallest nonzero number that is not a substring of n in its binary representation. 15
1, 2, 3, 2, 3, 3, 4, 2, 3, 3, 3, 4, 5, 4, 4, 2, 3, 3, 3, 5, 3, 3, 4, 4, 5, 5, 4, 4, 5, 4, 4, 2, 3, 3, 3, 5, 3, 3, 5, 5, 3, 3, 3, 4, 7, 4, 4, 4, 5, 5, 5, 5, 7, 4, 4, 4, 5, 5, 4, 4, 5, 4, 4, 2, 3, 3, 3, 5, 3, 3, 5, 5, 3, 3, 3, 6, 5, 7, 5, 5, 3, 3, 3, 6, 3, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

A261018(n) = a(A260273(n)).

Is a(n) = A091460(n) for n>1? - R. J. Mathar, Sep 02 2015

a(A062289(n))=A261922(A062289(n)); a(A126646(n))!=A261922(A126646(n)). - Reinhard Zumkeller, Sep 17 2015

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000

David Consiglio, Jr., Python Program

FORMULA

a(n) = A144016(n) + 1 for any n > 0. - Rémy Sigrist, Mar 10 2018

MATHEMATICA

fQ[m_, n_] := Block[{g}, g[x_] := ToString@ FromDigits@ IntegerDigits[x, 2]; StringContainsQ[g@ n, g@ m]]; Table[k = 1; While[fQ[k, n] && k < n, k++]; k, {n, 85}] (* Michael De Vlieger, Sep 21 2015 *)

PROG

(Haskell)

import Data.List (isInfixOf)

a261461 x = f $ tail a030308_tabf where

   f (cs:css) = if isInfixOf cs (a030308_row x)

                   then f css else foldr (\d v -> 2 * v + d) 0 cs

CROSSREFS

Cf. A007088, A030308, A260273, A261018; record values and where they occur: A261466, A261467.

See A261922 for a variant.

Cf. A062289, A144016, A261922, A126646.

Sequence in context: A248005 A129759 A137467 * A078627 A106370 A128630

Adjacent sequences:  A261458 A261459 A261460 * A261462 A261463 A261464

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller, Aug 30 2015

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 23 04:30 EST 2019. Contains 320411 sequences. (Running on oeis4.)