|
|
|
|
-1, -1, 0, 4, 22, 118, 718, 5038, 40318, 362878, 3628798, 39916798, 479001598, 6227020798, 87178291198, 1307674367998, 20922789887998, 355687428095998, 6402373705727998, 121645100408831998, 2432902008176639998, 51090942171709439998, 1124000727777607679998
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
It is possible to prove that, if gcd(k,a,b) = 1, then k^a + a^b + b^k = n! can be solved only if a = b = 1, thus k = n! - 2 for every n > 2.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
|
|
MATHEMATICA
|
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|