|
%I #5 Nov 07 2013 03:27:22
%S 5,2,2947253997913233984847871999999,29,23,19,719,4989599,
%T 39520825343999,11,11058645491711999,419,479001599,359,7,
%U 860234568201646565394748723848806399999999
%N Smallest father factorial prime p of order n = smallest prime of the form (p!-n)/n where p is prime.
%C For smallest daughter factorial prime p of order n (smallest p such that (p!+n)/n = p!/n + 1 is prime) see A139074.
%C For smallest son factorial prime p of order n = smallest prime of the form (p!-n)/n where p is prime see A139206.
%C For more terms see A139206.
%t 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*)
%Y Cf. A139074, A139189, A139190, A139191, A139192, A139193, A139194, A139195, A139196, A139197, A139198, A136019, A136020, A136026, A136027.
%K hard,nonn
%O 1,1
%A _Artur Jasinski_, Apr 11 2008
|
