A245695 Least number k >= 0 such that (n!+k)/n is prime.

1, 2, 0, 4, 25, 42, 49, 88, 207, 170, 121, 12, 377, 938, 285, 688, 391, 558, 703, 1780, 609, 682, 713, 2328, 3275, 1066, 1593, 28, 1943, 6690, 3317, 4064, 2607, 1258, 3395, 2196, 4847, 38, 1677, 3880, 2173, 42, 4171, 3124, 2115, 10994, 4747, 11184, 2597, 4150, 3111, 14092, 2809, 3834, 12265, 3976, 8493, 6206, 16697, 17580, 16531, 47678, 8253, 17344, 4355, 12738, 18961, 4964, 5727, 9170, 9869, 61704, 7373

Offset

1,2

Comments

a(n) = M*n for some integer M >= 0.

a(n) = n times least m >= 0 such that (n-1)!+m is prime. - Jens Kruse Andersen, Jul 30 2014

Links

Jens Kruse Andersen, Table of n, a(n) for n = 1..2001

Formula

a(n) = n*A033932(n-1), except a(3) = 0 where A033932 demands positive values. - Jens Kruse Andersen, Jul 30 2014

Example

(4!+0)/4 = 6 is not prime.
(4!+1)/4 = 25/4 is not prime.
(4!+2)/4 = 26/4 is not prime.
(4!+3)/4 = 27/4 is not prime.
(4!+4)/4 = 7 is prime. Thus a(4) = 4.

Prog

(PARI)
a(n)=for(k=0, 10^6, s=(n!+k)/n; if(floor(s)==s, if(ispseudoprime(s), return(k))))
n=1; while(n<100, print1(a(n), ", "); n++)

Crossrefs

Cf. A033932, A245696, A245697.

Sequence in context: A199852 A055978 A356189 * A069025 A356815 A352554

Adjacent sequences: A245692 A245693 A245694 * A245696 A245697 A245698

Keyword

nonn

Author

Derek Orr, Jul 29 2014

Status

approved