|
Search: id:A139207
|
|
|
| A139207 |
|
Smallest father factorial prime p of order n = smallest prime of the form (p!-n)/n where p is prime. |
|
+0
3
|
|
| 5, 2, 2947253997913233984847871999999, 29, 23, 19, 719, 4989599, 39520825343999, 11, 11058645491711999, 419, 479001599, 359, 7, 860234568201646565394748723848806399999999
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
For smallest daughter factorial prime p of order n (smallest p such that (p!+n)/n = p!/n + 1 is prime) see A139074
For smallest son factorial prime p of order n = smallest prime of the form (p!-n)/n where p is prime see A139206
more terms see A139206
|
|
MATHEMATICA
|
a = {}; Do[k = 1; While[ ! PrimeQ[(Prime[k]! - n)/n], k++ ]; Print[a]; AppendTo[a, [(Prime[k]! - n)/n], {n, 1, 100}]; a (*Artur Jasinski*)
|
|
CROSSREFS
|
Cf. A139074, A139189, A139190, A139191, A139192, A139193, A139194, A139195, A139196, A139197, A139198, A136019, A136020, A136026, A136027.
Adjacent sequences: A139204 A139205 A139206 this_sequence A139208 A139209 A139210
Sequence in context: A099612 A068566 A046270 this_sequence A137237 A077602 A065469
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Artur Jasinski (grafix(AT)csl.pl), Apr 11 2008
|
|
|
Search completed in 0.002 seconds
|
