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 A372229 #17 Oct 29 2024 03:28:53
%S A372229 2,3,7,13,311,43,337,193,333667,13421,266981089,28393,29914249171,
%T A372229 10678711,1321,184417,7563707819165039903,236377,192696104561,
%U A372229 920421641,12271836836138419,39700406579747,58769065453824529,152587500001,4315817869647001,797161
%N A372229 a(n) is the largest prime factor of n^n - n.
%H A372229 Amiram Eldar, <a href="/A372229/b372229.txt">Table of n, a(n) for n = 2..115</a>
%F A372229 a(n) = A006530(A061190(n)).
%p A372229 pf := n -> NumberTheory:-PrimeFactors(n): a := n -> max(pf(n^n - n));
%p A372229 seq(a(n), n = 2..27); # _Peter Luschny_, Apr 27 2024
%t A372229 Table[f = FactorInteger[n^n-n]; f[[Length[f]]][[1]], {n,2,25}] (* _Vaclav Kotesovec_, Apr 26 2024 *)
%o A372229 (Python)
%o A372229 from sympy import primefactors
%o A372229 def A372229(n): return max(max(primefactors(n),default=1),max(primefactors(n**(n-1)-1),default=1)) # _Chai Wah Wu_, Apr 27 2024
%Y A372229 Cf. A061190, A006530, A006486, A007571, A372228.
%K A372229 nonn
%O A372229 2,1
%A A372229 _Tyler Busby_, Apr 23 2024