1,1

For the corresponding primes p see A139075.

a(9)>5000, a(13)>5000, a(22)>5000, a(23) = 1579. - Andrew V. Sutherland (drew(AT)math.mit.edu), Apr 21 2008, Apr 22 2008

a(10)=5, a(11)=13, a(12)=5

a(14)= 17, a(15)=7, a(16)=13, a(17)=43, a(18)=7, a(19)=31, a(20)=5, a(21)=7

a(24)=7, a(25)=47, a(26)=17, a(27)=17, a(28)=7, a(29)=241, a(30)=5,

a(31)=61, a(32)=11, a(33)=17, a(34)=17, a(35)=29, a(36)=11, a(37)=61,

a(38)=103, a(39)=89, a(40)=7, a(41)=131, a(42)=11, a(43)=71, a(44)=13,

a(45)=7, a(46)=43, a(47)=73, a(48)=67, a(49)=347, a(50)=31, a(51)=19,

a(52)=17, a(53)=347, a(54)=11, a(55)=13, a(56)=13, a(57)=31, a(58)=73,

a(59)=641, a(60)=5

a(23) = 1579. - Andrew V. Sutherland (drew(AT)math.mit.edu), Apr 11 2008.

Smallest daughter factorial prime p of order n, i.e. smallest prime of the form (p!+n)/n where p is prime.

For smallest mother factorial prime p of order n see A139075

For smallest father factorial prime p of order n see A139207

For smallest son factorial prime p of order n see A139206

a(1) = 2 because 2 is the first prime and 2!/1 + 1 = 3 is prime

a(2) = 2 because 2 is the first prime and 2!/2 + 1 = 2 is prime

a(3) = 3 because 3!/3 + 1 = 3 is prime

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

Cf. A082672, A089085, A089130, A117141, A007749, A139056, A139057, A139058, A139059, A139060, A139061, A139061, A139062, A139063, A139064, A139065, A139066, A020458, A139068, A137390, A139070, A139071, A139072, A139073, A139074, A139074, A139075, A136019, A136020, A136026, A136027.

Sequence in context: A032157 A153926 A035425 this_sequence A035428 A100142 A079953

Adjacent sequences: A139071 A139072 A139073 this_sequence A139075 A139076 A139077

more,nonn

Artur Jasinski (grafix(AT)csl.pl), Apr 08 2008, Apr 21 2008