A261467 -id:A261467 - cp's OEIS frontend

A261461 a(n) is the smallest nonzero number that is not a substring of n in its binary representation.

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

Offset: 0

Reinhard Zumkeller, Aug 30 2015

A261018(n) = a(A260273(n)).
Is a(n) = A091460(n) for n>1? - R. J. Mathar, Sep 02 2015. The lowest counterexample occurs at a(121) = 5 < 6 = A091460(121). - Álvar Ibeas, Sep 08 2020
a(A062289(n))=A261922(A062289(n)); a(A126646(n))!=A261922(A126646(n)). - Reinhard Zumkeller, Sep 17 2015

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
David Consiglio, Jr., Python Program

Cf. A007088, A030308, A260273, A261018; record values and where they occur: A261466, A261467.
See A261922 for a variant.
Cf. A062289, A144016, A261922, A126646.

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

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 *)

from itertools import count
def a(n):
    b, k = bin(n)[2:], 1
    return next(k for k in count(1) if bin(k)[2:] not in b)
print([a(n) for n in range(86)]) # Michael S. Branicky, Feb 26 2023

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

A056744 a(n) is the smallest number which when written in binary contains as substrings the binary expansions of 1..n.

Original entry on oeis.org

1, 2, 6, 12, 44, 44, 92, 184, 1208, 1256, 4792, 4792, 9912, 9912, 19832, 39664, 563952, 576464, 4496112, 4499184, 17996528, 17997488, 143972080, 143972080, 145057520, 145070832, 294967024, 294967024, 589944560, 589944560, 1179889136, 2359778272, 71079255008

Offset: 1

Fred J. Schalekamp, Aug 15 2000

From Davis Smith, May 09 2021: (Start)
For n > 2, a(n) cannot be a power of 2.
If A007088(n) (the binary expansion of n) contains a string of k zeros, then it contains A007088(2^m), where 0 <= m <= k, as a substring. Similarly, if A007088(n) contains a string of k ones, then it contains A007088(2^m - 1), where 1 <= m <= k. Strings of zeros and ones are the most compact way to have powers of 2 and powers of 2 minus 1 (respectively) as substrings in a binary expansion. This means that A007088(a(n)) will contain a string of A000523(n) ones and a string of A000523(n) zeros. The binary expansion of a(2^k - 1) will contain a string of k ones and a string of k - 1 zeros.
Conjecture: a(n) == 0 (mod A053644(n)), i.e., A007088(a(n)) ends with the longest string of zeros. It follows from this that a(2^k) = 2*a(2^k - 1). A conjecture related to this is that a(2^k - 1) = 2*a(2^k - 2) + 2^(k - 1), i.e., A007088(a(2^k - 1)) ends with the longest string of ones followed by the longest string of zeros. Ending with the longest string of ones followed by the longest string of zeros is not true for all A007088(a(n)), as some have a hiccup before starting their string of zeros, e.g., a(10), a(18), a(22), and a(34).
Conjecture: a(2^k + 1) = 2^(k + floor(log_2(a(2^k)))) + a(2^k), i.e., concatenate the binary expansion of 2^(k - 1) to the front of the binary expansion of a(2^k) in order to get the binary expansion of a(2^k + 1).
(End)
All terms belong to A261467. - Rémy Sigrist, May 11 2021
From Jon E. Schoenfield, Jun 03 2021: (Start)
Conjecture: the binary expansion of a(n) contains exactly ceiling(n/2) 1's iff 2^m - 7 <= n <= 2^m + 6 for some integer m >= 3. (See Links.)
Conjecture: for n > 1, the binary expansion of a(n) begins with that of 2^floor(log_2(n-1)) + 1.(End)
From Davis Smith, Jun 05 2021: (Start)
For a proof that a(n) == 2^floor(log_2(n)) (mod 2^(floor(log_2(n)) + 1)), see my second link (not the b-file). This also proves the conjecture from May 09 2021 which states that it is congruent to 0 (mod A053644(n)). A proof for the related conjecture would likely rely on an explanation of values of n such that a(n) is not congruent to (2^floor(log_2(n)) - 1)*2^floor(log_2(n)) (mod 2^(2*floor(log_2(n)))), i.e. the values of n such that A007088(a(n)) does not end with a string of floor(log_2(n)) ones followed immediately by a string of floor(log_2(n)) zeros. A proof for Jon E. Schoenfield's second conjecture on Jun 03 2021 would satisfy my more restricted second conjecture and it may follow necessarily from my proof, assuming that A007088(a(n)) must begin with either A007088(2^floor(log_2(n - 1)) + 1) or A007088(2^floor(log_2(n))). (End)

			a(6)=44 because 101100 (44 in base 2) is the smallest number that contains 1, 10, 11, 100, 101 and 110 (1 through 6 in base 2).
Terms begin as follows (see Links for a longer table):
.
                a(n)
      =========================
   n  decimal      binary
  --  -------  ----------------
   1        1                 1
   2        2                10
   3        6               110
   4       12              1100
   5       44            101100
   6       44            101100
   7       92           1011100
   8      184          10111000
   9     1208       10010111000
  10     1256       10011101000
  11     4792     1001010111000
  12     4792     1001010111000
  13     9912    10011010111000
  14     9912    10011010111000
  15    19832   100110101111000
  16    39664  1001101011110000

Davis Smith, Table of n, a(n) for n = 1..64
David A. Corneth, substrings of a(33) and a(36) listed.
Jon E. Schoenfield, Conjecture on the number of 1's in the binary expansion of a(n).
Jon E. Schoenfield, Lower bounds on the numbers of 1-bits and 0-bits in a(n), a tabular method for deducing the order in which substrings occur in the binary expansion of a(n), and an approach for accounting for duplicate substrings when a(n) has more than ceiling(n/2) 1-bits, illustrated with a proof of the exact value of a(49).
Jon E. Schoenfield, Values for n = 1..64 in binary and decimal.
Davis Smith, Proof that A056744(n) == 2^floor(log_2(n)) (mod 2^(floor(log_2(n))+1)).

Cf. A000523, A035239, A007088, A053644, A053645, A078822, A119709 (binary substrings), A144016, A261467.

A056744_vec(n)={
    my(
        L=List([1]),x=L[#L],Z=n+#L,B=binary(x),
        A=setbinop((y,z)->fromdigits(B[y..z],2),[1..#B])
    );
    while(#Lfromdigits(B[y..z],2),[1..#B]));listput(L,x));Vec(L)
} \\ Davis Smith, May 09 2021

A144016(a(n)) >= n. - Rémy Sigrist, May 11 2021

More terms from Naohiro Nomoto, Jul 20 2001
a(25)-a(31) from Ray Chandler, Nov 06 2008
a(32) from Davis Smith, May 10 2021
a(33) from Jon E. Schoenfield, May 11 2021

A144016 a(n) = the largest positive integer m such that the binary representations of all positive integers <= m are found within the binary representation of n.

Original entry on oeis.org

1, 2, 1, 2, 2, 3, 1, 2, 2, 2, 3, 4, 3, 3, 1, 2, 2, 2, 4, 2, 2, 3, 3, 4, 4, 3, 3, 4, 3, 3, 1, 2, 2, 2, 4, 2, 2, 4, 4, 2, 2, 2, 3, 6, 3, 3, 3, 4, 4, 4, 4, 6, 3, 3, 3, 4, 4, 3, 3, 4, 3, 3, 1, 2, 2, 2, 4, 2, 2, 4, 4, 2, 2, 2, 5, 4, 6, 4, 4, 2, 2, 2, 5, 2, 2, 3, 3, 6, 6, 3, 3, 7, 3, 3, 3, 4, 4, 4, 4, 4, 6, 4, 4, 6, 6

Offset: 1

Leroy Quet, Sep 07 2008

From Rémy Sigrist, Mar 10 2018: (Start)
a(n) is the greatest k <= n such that A213629(n, i) > 0 for i = 1..k.
See A261467 for the indices of record values.
(End)

			44 in binary is 101100. In this string we find 1 (1 in decimal): (1)01100; 10 (2 in decimal): (10)1100; 11 (3 in decimal): 10(11)00; 100 (4 in decimal): 101(100); 101 (5 in decimal): (101)100; and 110 (6 in decimal): 10(110)0; but not 111 (7 in decimal). So a(44) = 6.

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Cf. A213629, A261461, A261467.

a(n) = A261461(n) - 1. - Rémy Sigrist, Mar 10 2018

Extended by Ray Chandler, Nov 07 2008

A261466 Records in A261461.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 15, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 29, 31, 32, 33, 34, 35

Offset: 1

Reinhard Zumkeller, Aug 30 2015

a(n) = A261461(A261467(n)).

Cf. A261461, A261467.

a261466 n = a261466_list !! (n-1)
(a261466_list, a261467_list) = unzip $ (0, 1) : f 0 1 where
   f i x | y > x     = (y, i) : f (i + 1) y
         | otherwise = f (i + 1) x
         where y = a261461 i

from itertools import count, islice
def f(n):
    b, k = bin(n)[2:], 1
    return next(k for k in count(1) if bin(k)[2:] not in b)
def agen(record=-1):
    yield from (((record:=f(k)), k)[0] for k in count(0) if f(k) > record)
print(list(islice(agen(), 18))) # Michael S. Branicky, Feb 26 2023

Initial terms corrected and more terms from Rémy Sigrist, Mar 10 2018

a(26)-a(29) from Rémy Sigrist, Feb 26 2023

cp's OEIS Frontend

A261461 a(n) is the smallest nonzero number that is not a substring of n in its binary representation.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Mathematica

Python

Formula

A056744 a(n) is the smallest number which when written in binary contains as substrings the binary expansions of 1..n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

Extensions

A144016 a(n) = the largest positive integer m such that the binary representations of all positive integers <= m are found within the binary representation of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

Extensions

A261466 Records in A261461.

Views

Author

Keywords

Comments

Crossrefs

Programs

Haskell

Python

Extensions