|
Search: id:A136146
|
|
|
| A136146 |
|
Smallest m such that (2^n)! + m is prime. |
|
+0
3
|
|
| 1, 0, 5, 23, 23, 79, 67, 823, 863, 683, 16453, 2753, 26297
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
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.
|
|
PROGRAM
|
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: A081319 A002582 A102723 this_sequence A167804 A018527 A084411
Adjacent sequences: A136143 A136144 A136145 this_sequence A136147 A136148 A136149
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)hotmail.com), May 10 2008, May 17 2008
|
|
|
Search completed in 0.002 seconds
|
