A353710 Smallest missing number when A353709(n) is being calculated.
0, 1, 2, 3, 3, 3, 5, 5, 5, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 11, 11, 11, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 27, 27, 27, 27, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29
Offset: 0
Links
- Rémy Sigrist, Table of n, a(n) for n = 0..16384
- Rémy Sigrist, PARI program
Programs
-
PARI
See Links section.
-
Python
from itertools import count, islice def A353710_gen(): # generator of terms s, a, b, c, ab = {0,1}, 0, 1, 2, 1 yield from (0,1) while True: for n in count(c): if not (n & ab or n in s): yield c a, b = b, n ab = a|b s.add(n) while c in s: c += 1 break A353710_list = list(islice(A353710_gen(),20)) # Chai Wah Wu, May 10 2022