cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A353710 Smallest missing number when A353709(n) is being calculated.

Original entry on oeis.org

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

Views

Author

N. J. A. Sloane, May 06 2022

Keywords

Crossrefs

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