A354143 a(n) = smallest number missing from A353733 after A353733(n) has been found.

1, 2, 3, 3, 3, 3, 3, 7, 7, 7, 7, 7, 7, 11, 11, 11, 11, 11, 11, 13, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 23, 25, 25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 27, 27, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 31, 43, 43, 43, 43, 43, 43

Offset: 0

Author

N. J. A. Sloane, May 18 2022

Keywords

• nonn

Links

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

Crossrefs

Cf. A353733, A352808, A354142.

Programs

Python

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