|
|
A073443
|
|
Numbers n such that n! - n - 1 is prime.
|
|
4
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Clearly n <> 2 (mod 3). For n>3, n!-n, n!-n+1, ..., n!-3, n!-2 is a sequence of n-1 consecutive composite numbers. Additional terms are greater than 2000.
|
|
LINKS
|
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) for(n=3, 2000, if(isprime(n!-n-1), print1(n, ", ")))
(Python)
from math import factorial
from sympy import isprime
def ok(n): return isprime(factorial(n) - n - 1)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|