A354142 a(n) = smallest number missing from A352808 after A352808(n) has been found.

1, 2, 3, 3, 3, 3, 6, 6, 6, 6, 7, 11, 11, 11, 11, 11, 11, 11, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 23, 26, 26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 30, 30, 30, 30, 30, 30, 31, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43

Offset

0,2

Links

Michael S. Branicky, Table of n, a(n) for n = 0..10000

Example

A352808 (with offset 0) begins 0,1,2,4,5,8; after A352808(0) = 0 has been found, the smallest missing number is 1, so a(0) = 1; after A352808(5) = 8 has been found, the smallest missing number is 3, so a(5) = 3.

Prog

(Python)
from itertools import count, islice
def agen(): # generator of terms
    A352808lst, A352808set, mink = [0], {0}, 1
    for n in count(1):
        yield mink
        ahalf, k = A352808lst[n//2], mink
        while k in A352808set or k&ahalf: k += 1
        A352808lst.append(k); A352808set.add(k)
        while mink in A352808set: mink += 1
print(list(islice(agen(), 78))) # Michael S. Branicky, May 18 2022

Crossrefs

Cf. A352808.

Sequence in context: A227246 A200924 A111913 * A210796 A305419 A075757

Adjacent sequences: A354139 A354140 A354141 * A354143 A354144 A354145

Keyword

nonn

Author

N. J. A. Sloane, May 18 2022

Status

approved