OFFSET
1,1
COMMENTS
1) Q=(p^16)^2+(2^16)^2 only for Q=4k+1 because of Fermat/Euler/Lagrange theorem concerning prime as sum of two squares.
2) It is conjectured that sequence a(n) is infinite.
3) Note the twin prime: a(3)=101, a(4)=103.
The next set of twins is a(101)=30557, a(102)=30559. - Robert Israel, Apr 05 2016
REFERENCES
Richard E. Crandall, Carl Pomerance, Prime Numbers: A Computational Perspective, Springer 2001.
Leonard E. Dickson, History of the Theory of Numbers, Dover Pub. Inc., 2005.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
FORMULA
n^32+2^32 and n to be prime.
EXAMPLE
p=3: 3^32+2^32=1853024483819137 = 1153 x 1607133116929 no prime;
also for following primes p=5, 7, 11, 13, 17, 19, 23: Q(p) no prime;
p=29: 29^32+2^32=62623297589448778360828428329074752313100292737 is prime => a(1)=29.
MAPLE
select(t -> isprime(t) and isprime(t^32 + 2^32), [seq(i, i=3..10000, 2)]); # Robert Israel, Apr 05 2016
MATHEMATICA
With[{c=2^32}, Select[Prime[Range[1300]], PrimeQ[#^32+c]&]] (* Harvey P. Dale, May 04 2018 *)
PROG
(PARI) isA158477(n) = isprime(n) && isprime(n^32+4294967296) \\ Michael B. Porter, Dec 17 2009
(PARI) lista(nn) = forprime(p=3, nn, if(ispseudoprime(p^32+2^32), print1(p, ", "))); \\ Altug Alkan, Apr 05 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
Ulrich Krug (leuchtfeuer37(AT)gmx.de), Mar 20 2009
STATUS
approved