The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A064711 Numbers n such that n^2 + prime(n) is a prime. 6
 1, 2, 4, 8, 12, 14, 22, 30, 36, 38, 44, 50, 54, 60, 66, 74, 78, 84, 90, 96, 106, 134, 144, 156, 162, 168, 180, 188, 216, 222, 224, 234, 260, 264, 272, 308, 324, 336, 344, 366, 368, 374, 378, 390, 402, 406, 422, 466, 468, 476, 492, 498, 502, 516, 604, 624, 636 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Harry J. Smith, Table of n, a(n) for n=1..1000 EXAMPLE 2 is in the sequence because 2^2 + Prime(2) = 4 + 3 = 7 is a prime. MATHEMATICA Select[ Range[ 1000 ], PrimeQ[ #^2 + Prime[ # ] ] & ] PROG (PARI) { n=0; for (m=1, 10^9, if (isprime(m^2 + prime(m)), write("b064711.txt", n++, " ", m); if (n==1000, break)) ) } \\ Harry J. Smith, Sep 23 2009 (Magma) [ n: n in [1..700] | IsPrime(n^2+NthPrime(n)) ]; // Klaus Brockhaus, Apr 12 2011 CROSSREFS Cf. A004232, A184935. Sequence in context: A024906 A160162 A328838 * A050865 A354109 A354919 Adjacent sequences: A064708 A064709 A064710 * A064712 A064713 A064714 KEYWORD easy,nonn AUTHOR Robert G. Wilson v, Oct 13 2001 STATUS approved

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

Last modified December 9 23:05 EST 2022. Contains 358710 sequences. (Running on oeis4.)