|
| |
|
|
A100599
|
|
Numbers n such that (prime(n)-1)! + prime(n)^7 is prime.
|
|
0
| | |
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| n={7, 14, 16, 59} yields primes p(n)={17, 43, 53, 277}. 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)^7 is prime, where prime(n) is the n-th prime.
|
|
|
EXAMPLE
| a(7) = 7 because (prime(7)-1)! + prime(7)^7 = (17-1)! + 17^7 = 20923200226673 is the smallest prime of that form.
|
|
|
MATHEMATICA
| lst={}; Do[p=Prime[n]; If[PrimeQ[(p-1)!+p^7], AppendTo[lst, n]], {n, 10^2}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Sep 08 2008]
|
|
|
CROSSREFS
| Cf. A100858.
Sequence in context: A115770 A086779 A167197 * A198390 A118905 A092433
Adjacent sequences: A100596 A100597 A100598 * A100600 A100601 A100602
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Jonathan Vos Post (jvospost3(AT)gmail.com), Nov 30 2004
|
| |
|
|
