|
Search: id:A116894
|
|
|
| A116894 |
|
Numbers n such that GCD(n!+1, n^n+1) is neither 1 nor 2n+1. |
|
+0
5
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
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. a(6) > 222000. - Hans Havermann (pxp(AT)rogers.com), Mar 28 2006
|
|
EXAMPLE
|
GCD(1!+1,1^1+1)=2 and 2!=2*1+1, so 1 belongs to the sequence.
|
|
CROSSREFS
|
Cf. A014566, A038507, A067658, A116891, A116892, A116893.
Adjacent sequences: A116891 A116892 A116893 this_sequence A116895 A116896 A116897
Sequence in context: A035902 A105654 A124410 this_sequence A124629 A125016 A043580
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Giovanni Resta (g.resta(AT)iit.cnr.it), Mar 01 2006
|
|
EXTENSIONS
|
a(5) from Hans Havermann (pxp(AT)rogers.com), Mar 28 2006
|
|
|
Search completed in 0.002 seconds
|
