|
Search: id:A100596
|
|
|
| A100596 |
|
Numbers n such that (prime(n)-1)! + prime(n)^10 is prime. |
|
+0
1
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
n={2, 8, 15, 33, 52} yields primes p(n)={3, 19, 47, 137, 239}. There are no more such n up to n=150. Computed in collaboration with Ray Chandler.
|
|
FORMULA
|
Primes of the form (prime(n)-1)! + prime(n)^10, where prime(n) is the n-th prime.
|
|
EXAMPLE
|
a(1) = 2 because (prime(2)-1)! + prime(2)^10 = (3-1)! + 3^10 = 59051 is the smallest prime of that form.
a(2) = 8 because (prime(8)-1)! + prime(8)^10 = (19-1)! + 19^10 = 6408504771985801 is the 2nd smallest prime of that form.
|
|
MATHEMATICA
|
lst={}; Do[p=Prime[n]; If[PrimeQ[(p-1)!+p^10], AppendTo[lst, n]], {n, 10^2}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Sep 08 2008]
|
|
CROSSREFS
|
Cf. A100858.
Sequence in context: A133230 A077598 A095298 this_sequence A082638 A077388 A167592
Adjacent sequences: A100593 A100594 A100595 this_sequence A100597 A100598 A100599
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jonathan Vos Post (jvospost3(AT)gmail.com), Nov 30 2004
|
|
|
Search completed in 0.002 seconds
|
