|
| |
|
|
A136146
|
|
Smallest m such that (2^n)! + m is prime.
|
|
2
| |
|
|
1, 0, 5, 23, 23, 79, 67, 823, 863, 683, 16453, 2753, 26297
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| If n > 7, a(n) is a 3-PRP.
|
|
|
LINKS
| Cino Hilliard, Primes in (x^n)! + m.
|
|
|
EXAMPLE
| For n=1, (2^1)! + 0 = 2 a prime. So 0 is the second entry in the sequence.
For n=9, (2^9)! + 683 is a 3-PRP. So 683 is in the sequence.
|
|
|
PROG
| The Gcc program in the link uses Gmp mpz_nextprime to generate the sequence. Pfgw was also used as a verification.
|
|
|
CROSSREFS
| Sequence in context: A177242 A002582 A102723 * A167804 A196243 A018527
Adjacent sequences: A136143 A136144 A136145 * A136147 A136148 A136149
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Cino Hilliard (hillcino368(AT)hotmail.com), May 10 2008, May 17 2008
|
| |
|
|
