A139207 Smallest father factorial prime p of order n = smallest prime of the form (p!-n)/n where p is prime.

5, 2, 2947253997913233984847871999999, 29, 23, 19, 719, 4989599, 39520825343999, 11, 11058645491711999, 419, 479001599, 359, 7, 860234568201646565394748723848806399999999

Offset

1,1

Comments

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.

For more terms see A139206.

Links

Table of n, a(n) for n=1..16.

Mathematica

a = {}; Do[k = 1; While[ ! PrimeQ[(Prime[k]! - n)/n], k++ ]; Print[a]; AppendTo[a, (Prime[k]! - n)/n], {n, 1, 100}]; a

Crossrefs

Cf. A139074, A139189, A139190, A139191, A139192, A139193, A139194, A139195, A139196, A139197, A139198, A136019, A136020, A136026, A136027.

Sequence in context: A212481 A046270 A388038 * A137237 A369841 A152419

Adjacent sequences: A139204 A139205 A139206 * A139208 A139209 A139210

Keyword

hard,nonn

Author

Artur Jasinski, Apr 11 2008

Status

approved