OFFSET
1,1
COMMENTS
Sequence appears to contain each prime number once or twice.
FORMULA
For some even k: gcd(k!+1, k^k-1) = k+1;
for some odd k: gcd(k!+1, k^k-1) = 2*k+1.
EXAMPLE
For k=25, gcd(k!+1, k^k-1) = 401;
for k=788, gcd(k!+1, k^k-1) = 4729.
MAPLE
select(x-> x>1, [seq(igcd(k!+1, k^k-1), k=1..300)])[]; # Alois P. Heinz, Oct 26 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Feb 03 2002
STATUS
approved