OFFSET
1,1
COMMENTS
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.
LINKS
A. R. Booker, On Mullin's second sequence of primes, Integers, 12A (2012), article A4.
C. D. Cox and A. J. van der Poorten, On a sequence of prime numbers, Journal of the Australian Mathematical Society 8 (1968), pp. 571-574.
A. A. Mullin, Research Problem 8: Recursive function theory, Bull. Amer. Math. Soc., 69 (1963), 737.
P. Pollack and E. Trevino, The primes that Euclid forgot, 2013.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Andrew R. Booker, Mar 13 2013
STATUS
approved