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.

This page as a plain text file.
%I A353710 #14 May 10 2022 09:54:55
%S A353710 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,
%T A353710 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,
%U A353710 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
%N A353710 Smallest missing number when A353709(n) is being calculated.
%H A353710 Rémy Sigrist, <a href="/A353710/b353710.txt">Table of n, a(n) for n = 0..16384</a>
%H A353710 Rémy Sigrist, <a href="/A353710/a353710.gp.txt">PARI program</a>
%o A353710 (PARI) See Links section.
%o A353710 (Python)
%o A353710 from itertools import count, islice
%o A353710 def A353710_gen(): # generator of terms
%o A353710     s, a, b, c, ab = {0,1}, 0, 1, 2, 1
%o A353710     yield from (0,1)
%o A353710     while True:
%o A353710         for n in count(c):
%o A353710             if not (n & ab or n in s):
%o A353710                 yield c
%o A353710                 a, b = b, n
%o A353710                 ab = a|b
%o A353710                 s.add(n)
%o A353710                 while c in s:
%o A353710                     c += 1
%o A353710                 break
%o A353710 A353710_list = list(islice(A353710_gen(),20)) # _Chai Wah Wu_, May 10 2022
%Y A353710 Cf. A084937, A353709.
%K A353710 nonn,base
%O A353710 0,3
%A A353710 _N. J. A. Sloane_, May 06 2022