Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #19 Oct 29 2024 08:28:43
%S 2,3,5,13,313,101,181,5419,21523361,52579,212601841,57154490053,
%T 815702161,100621,4454215139669,4562284561,52548582913,
%U 1895634885375961,211573,2272727294381,415710882920521,9299179,1853387306082786629,22496867303759173834520497
%N a(n) is the largest prime factor of n^n + n.
%H Amiram Eldar, <a href="/A372228/b372228.txt">Table of n, a(n) for n = 1..116</a>
%F a(n) = A006530(A066068(n)).
%t Table[f = FactorInteger[n^n + n]; f[[Length[f]]][[1]], {n, 1, 25}] (* _Vaclav Kotesovec_, Apr 26 2024 *)
%o (Python)
%o from sympy import primefactors
%o def A372228(n): return max(max(primefactors(n),default=1),max(primefactors(n**(n-1)+1))) # _Chai Wah Wu_, Apr 27 2024
%Y Cf. A066068, A006530, A006486, A007571, A372229.
%K nonn
%O 1,1
%A _Tyler Busby_, Apr 23 2024