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.
%I A216227 #30 Feb 03 2023 01:39:50 %S A216227 5,11,13,17,19,23,29,31,37,41,47,53,59,61,67,71,73 %N A216227 Prime numbers that do not appear in the Euclid-Mullin sequence A000946. %C A216227 The sequence is known to continue indefinitely, but it is not known whether it is recursively enumerable. Cox and van der Poorten conjectured that it is and gave a method of computing new terms using the known terms of A000946. %H A216227 A. R. Booker, <a href="http://www.emis.de/journals/INTEGERS/papers/a4self/a4self.Abstract.html">On Mullin's second sequence of primes</a>, Integers, 12A (2012), article A4. %H A216227 C. D. Cox and A. J. van der Poorten, <a href="http://dx.doi.org/10.1017/S1446788700006236">On a sequence of prime numbers</a>, Journal of the Australian Mathematical Society 8 (1968), pp. 571-574. %H A216227 A. A. Mullin, <a href="http://dx.doi.org/10.1090/S0002-9904-1963-11017-4">Research Problem 8: Recursive function theory</a>, Bull. Amer. Math. Soc., 69 (1963), 737. %H A216227 P. Pollack and E. Trevino, <a href="http://pollack.uga.edu/mullin.pdf">The primes that Euclid forgot</a>, 2013. %Y A216227 Cf. A000946 (Euclid-Mullin sequence). %K A216227 nonn,more %O A216227 1,1 %A A216227 _Andrew R. Booker_, Mar 13 2013