This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A116894 #26 Aug 05 2025 18:04:50 %S A116894 1,5427,41255,43755,208161,496175,497135 %N A116894 Numbers k such that gcd(k! + 1, k^k + 1) is neither 1 nor 2k+1. %C A116894 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 %C A116894 a(8) > 1000000. - _Nick Hobson_, Feb 20 2024 %e A116894 gcd(1! + 1, 1^1 + 1) = 2 and 2 != 2*1 + 1, so 1 belongs to the sequence. %o A116894 (C) // See Links section in A116893. %Y A116894 Cf. A014566, A038507, A067658, A116891, A116892, A116893. %K A116894 nonn,hard,more %O A116894 1,2 %A A116894 _Giovanni Resta_, Mar 01 2006 %E A116894 a(5) from _Hans Havermann_, Mar 28 2006 %E A116894 a(6)-a(7) from _Nick Hobson_, Feb 20 2024