|
| |
|
|
A117588
|
|
Numbers n such that 2^n + prime(n)^2 is prime.
|
|
0
| |
|
|
2, 6, 8, 14, 20, 90, 102, 154, 228, 310, 418, 554, 1070, 1224, 3144, 3996, 4464, 16194, 17096
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| a(n) is always even since for any odd number k, 2^k+prime(k)^2 == 0 (mod 3). - Robert G. Wilson v (rgwv(at)rgwv.com) Apr 03 2006
If k is odd, prime(k) is either == +/- 1 (mod 3) making prime(k)^2 == 1 (mod 3) and 2^k is - 1 (mod 3). - Robert G. Wilson v (rgwv(at)rgwv.com) Apr 03 2006
No more terms below 30000.
|
|
|
EXAMPLE
| 20 is in the sequence because the 20th prime is 71 and 2^20+71^2=1053617 is prime.
|
|
|
MAPLE
| a:=proc(n) if isprime(2^n+ithprime(n)^2)=true then n else fi end: seq(a(n), n=1..1300); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 06 2006
|
|
|
MATHEMATICA
| Do[ If[ PrimeQ[2^n + Prime[n]^2], Print[n]], {n, 20000}] (* Robert G. Wilson v *)
|
|
|
PROG
| (PARI) for(i=1, 3000, if(isprime(2^i+prime(i)^2), print1(i, ", ")))
|
|
|
CROSSREFS
| Sequence in context: A063242 A104636 A137831 * A174229 A187217 A022112
Adjacent sequences: A117585 A117586 A117587 * A117589 A117590 A117591
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Mohammed Bouayoun (mohammed.bouayoun(AT)sanef.com), Apr 03 2006
|
|
|
EXTENSIONS
| a(15)-a(19) from Robert G. Wilson v (rgwv(at)rgwv.com) and Giovanni Resta (g.resta(AT)iit.cnr.it), Apr 03 2006
|
| |
|
|
