The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064539 Numbers n such that 2^n + n^2 is prime. 6
1, 3, 9, 15, 21, 33, 2007, 2127, 3759, 29355, 34653, 57285, 99069, 1933695 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Values 2^2007+2007^2, 2^2127+2127^2, 2^3759+3759^2 were proved prime with Primo.
n is always an odd multiple of 3 (except for the first term), i.e., a(n) is a subsequence of A016945. - Lekraj Beedassy, Jan 01 2007
Some of the results were computed using the PrimeFormGW (PFGW) primality-testing program. - Hugo Pfoertner, Nov 14 2019
REFERENCES
J.-M. De Koninck & A. Mercier, 1001 Problemes en Theorie Classique Des Nombres, Problem 165 pp. 30, 160, Ellipses Paris 2004.
LINKS
Henri Lifchitz, Renaud Lifchitz, PRP Top Records. 2^n+n^2.
PROG
(PARI) for(n=1, 5000, if(isprime(2^n+n^2), print(n)))
CROSSREFS
Sequence in context: A114271 A137164 A108701 * A029482 A174786 A216974
KEYWORD
nonn,more,hard
AUTHOR
Jason Earls, Oct 16 2001
EXTENSIONS
a(10)-a(13) from Hugo Pfoertner, Jun 26 2004
a(14) from Ryan Propper, May 11 2023. n=1933695 corresponds to a probable prime with 582101 digits, and was PRP tested with PFGW.
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 15 10:29 EDT 2024. Contains 372540 sequences. (Running on oeis4.)