|
Search: id:A100600
|
|
|
| A100600 |
|
Numbers n such that (prime(n)-1)! + prime(n)^6 is prime. |
|
+0
1
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
n={3, 4, 29, 32} yields primes p(n)={5, 7, 109, 131}. There are no more such n up to n=100. Computed in collaboration with Ray Chandler.
|
|
LINKS
|
J. V. Post, Math Pages.
|
|
FORMULA
|
Numbers n such that (prime(n)-1)! + prime(n)^6 is prime, where prime(n) is the n-th prime.
|
|
EXAMPLE
|
a(1) = 3 because (prime(3)-1)! + prime(3)^6 = (5-1)! + 5^6 = 15649 is the smallest prime of that form.
|
|
MATHEMATICA
|
lst={}; Do[p=Prime[n]; If[PrimeQ[(p-1)!+p^6], AppendTo[lst, n]], {n, 10^2}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Sep 08 2008]
|
|
CROSSREFS
|
Cf. A100858.
Sequence in context: A042829 A140896 A005326 this_sequence A076001 A032833 A151466
Adjacent sequences: A100597 A100598 A100599 this_sequence A100601 A100602 A100603
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jonathan Vos Post (jvospost3(AT)gmail.com), Nov 30 2004
|
|
|
Search completed in 0.002 seconds
|
