|
Search: id:A100663
|
|
|
| A100663 |
|
Composite q such that 4^q + q is prime. |
|
+0
1
|
| |
|
|
OFFSET
|
9,1
|
|
|
MATHEMATICA
|
For[n = 1, n < 5000, n++, If[Not[PrimeQ[n]], If[PrimeQ[4^n + n], Print[n]]]] (Steinerberger)
|
|
PROGRAM
|
(PARI) \ p^q + q is prime q not prime ptoqpq(p, n)= { local(x, y, q); for(q=6, n, if(q%2, if(!isprime(q), y=p^q+q; if(ispseudoprime(y), print1(q", ")) ) ) ) }
|
|
CROSSREFS
|
Adjacent sequences: A100660 A100661 A100662 this_sequence A100664 A100665 A100666
Sequence in context: A043137 A043917 A037378 this_sequence A029712 A136353 A136354
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Jan 12 2005
|
|
EXTENSIONS
|
a(6) from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jan 27 2006
|
|
|
Search completed in 0.002 seconds
|
