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 A116895 #6 Dec 19 2018 19:02:53
%S A116895 3,2,3,2,5,2,3,2,3,2,5,2,3,2,3,2,7,2,3,2,3,2,5,2,3,2,3,2,7,2,3,2,3,2,
%T A116895 5,2,3,2,3,2,13,2,3,2,3,2,5,2,3,2,3,2,5,2,3,2,3,2,7,2,3,2,3,2,5,2,3,2,
%U A116895 3,2,5,2,3,2,3,2,7,2,3,2,3,2,5,2,3,2,3,2,7,2,3,2,3,2,5,2,3,2,3,2,7,2
%N A116895 Least prime factor of n^n-1.
%C A116895 If n is odd then a(n)=2; also, if n is even and not divisible by 3 then a(n)=3. - _Zak Seidov_, Mar 03 2006
%H A116895 Antti Karttunen, <a href="/A116895/b116895.txt">Table of n, a(n) for n = 2..16384</a>
%e A116895 6^6-1=5*7*31*43, so a(6)=5.
%t A116895 Table[FactorInteger[GCD[n^n-1, 200! ]][[1,1]], {n, 2, 130}]
%o A116895 (PARI) A116895(n) = { my(k=(n^n)-1); forprime(p=2, ,if(!(k%p),return(p))); }; \\ _Antti Karttunen_, Dec 19 2018
%Y A116895 Cf. A006486, A007571, A048861.
%K A116895 nonn
%O A116895 2,1
%A A116895 _Giovanni Resta_, Mar 02 2006