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.

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

This page as a plain text file.
%I A354143 #10 May 19 2022 09:20:01
%S A354143 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,
%T A354143 15,15,15,15,15,15,15,15,15,15,23,25,25,25,25,25,25,25,26,26,26,26,27,
%U A354143 27,29,29,29,29,29,29,29,29,29,29,31,43,43,43,43,43,43
%N A354143 a(n) = smallest number missing from A353733 after A353733(n) has been found.
%H A354143 Michael S. Branicky, <a href="/A354143/b354143.txt">Table of n, a(n) for n = 0..10000</a>
%o A354143 (Python)
%o A354143 from itertools import count, islice
%o A354143 def agen(): # generator of terms
%o A354143     A353733lst, A353733set, mink = [0], {0}, 1
%o A354143     for n in count(1):
%o A354143         yield mink; A353733half, k = A353733lst[(n-1)//2], mink
%o A354143         while k in A353733set or k&A353733half: k += 1
%o A354143         A353733lst.append(k); A353733set.add(k)
%o A354143         while mink in A353733set: mink += 1
%o A354143 print(list(islice(agen(), 68))) # _Michael S. Branicky_, May 18 2022
%Y A354143 Cf. A353733, A352808, A354142.
%K A354143 nonn
%O A354143 0,2
%A A354143 _N. J. A. Sloane_, May 18 2022