OFFSET
1,1
COMMENTS
Other known values: a(16)=17 and a(40)=41 (which is generated by Euler's polynomial, A005846). There are no other terms less than 10^12. All of Euler's Lucky numbers, A014556, are in this sequence. Assuming the prime k-tuples conjecture, Mollin's theorem 2.1 shows this sequence is defined for n>0.
a(21)=234505015943235329417 found by J. Waldvogel and Peter Leikauf. [Jens Kruse Andersen, Sep 09 2009]
LINKS
R. A. Goudsmit, Unusual Prime Number Sequences, Nature, Vol. 214 (June 10, 1967), page 1164.
R. A. Mollin, Prime-Producing Quadratics, The American Mathematical Monthly, Vol. 104, No. 6 (Jun. - Jul., 1997), pp. 529-544.
MATHEMATICA
PrimeRun[p_Integer] := Module[{k=0}, While[PrimeQ[k^2+k+p], k++ ]; k]; nn=8; t=Table[0, {nn}]; cnt=0; p=1; While[cnt<nn, p=NextPrime[p]; n=PrimeRun[p]; If[n<=nn && t[[n]]==0, t[[n]]=p; cnt++ ]]; t
CROSSREFS
KEYWORD
hard,nonn,more
AUTHOR
T. D. Noe, Sep 01 2009
EXTENSIONS
a(14) and a(15) from Jens Kruse Andersen, Sep 09 2009
STATUS
approved