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 A116891 #18 Jul 22 2018 12:31:37
%S A116891 2,1,7,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,47,1,1,1,1,1,1,1,1,1,1,1,
%T A116891 1,1,1,1,79,1,1,1,1,1,1,1,1,1,1,1,103,1,1,1,1,1,1,1,1,1,1,1,127,1,1,1,
%U A116891 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,191,1,1,1,199,1,1
%N A116891 a(n) = gcd(n! + 1, n^n + 1).
%C A116891 Apparently all the values greater than 1 (cf. A116892) are prime numbers and are equal to 2n+1 with only 4 exceptions for n<82000 (cf. A116894).
%C A116891 From _Antti Karttunen_, Jul 22 2018: (Start)
%C A116891 The first duplicated value > 1 is 157519 = a(43755) = a(78759). Note that 43755 = 15*2917, while 78759 = 27*2917.
%C A116891 It seems that for the long time after a(1) = 2, all other terms > 1 occur only at such positions k that k+1 is not squarefree. However, this turns out to be false as a(208161) = 555097, and 208162 is a squarefree number.
%C A116891 (End)
%H A116891 Antti Karttunen, <a href="/A116891/b116891.txt">Table of n, a(n) for n = 1..80001</a>
%e A116891 a(3) = gcd(3! + 1, 3^3 + 1) = gcd(7,28) = 7.
%t A116891 Table[GCD[n! + 1, n^n + 1], {n, 101}] (* _Robert G. Wilson v_, Mar 09 2006 *)
%o A116891 (PARI) A116891(n) = gcd(n!+1,(n^n)+1); \\ _Antti Karttunen_, Jul 22 2018
%Y A116891 Cf. A014566, A038507, A067658, A116892, A116893, A116894.
%K A116891 easy,nonn
%O A116891 1,1
%A A116891 _Giovanni Resta_, Mar 01 2006