|
|
A116894
|
|
Numbers k such that gcd(k! + 1, k^k + 1) is neither 1 nor 2k+1.
|
|
4
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
g(n) = gcd(n! + 1, n^n + 1) is almost always equal to 1 or to 2n+1. These are the known exceptions: g(1) = 2, g(5427) = 10453, g(41255) = 129341, g(43755) = 157519, g(208161) = 555097. - Hans Havermann, Mar 28 2006
|
|
LINKS
|
|
|
EXAMPLE
|
gcd(1! + 1, 1^1 + 1) = 2 and 2 != 2*1 + 1, so 1 belongs to the sequence.
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|