This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A165234 Least prime p such that 2x^2 + p produces primes for x=0..n-1 and composite for x=n. 3
 2, 17, 3, 1481, 5, 149, 569, 2081, 2339, 5939831, 11, 33164857769 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Other known values: a(14)=272259344081 and a(29)=29. There are no other terms less than 10^12. The primes p = 3, 5, 11, and 29 produce p consecutive distinct primes because the imaginary quadratic field Q(sqrt(-2p)) has class number 2. Assuming the prime k-tuples conjecture, this sequence is defined for n>0. REFERENCES Paulo Ribenboim, My Numbers, My Friends, Springer,2000, pp. 349-350. LINKS R. A. Mollin, Prime-producing quadratics, Amer. Math. Monthly 104 (1997), 529-544. Eric W. Weisstein, Prime-Generating Polynomial MATHEMATICA PrimeRun[p_Integer] := Module[{k=0}, While[PrimeQ[2k^2+p], k++ ]; k]; nn=9; t=Table[0, {nn}]; cnt=0; p=1; While[cnt

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 13 09:58 EST 2019. Contains 329968 sequences. (Running on oeis4.)