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 A191624 #26 Jun 09 2022 09:06:53
%S A191624 7,19,293,1493,179,1091,10593529,379721,165664841,66987982331,
%T A191624 240717199,28048051,133933781,25506609089573701,107140256350247,
%U A191624 793435901761,268232479553269300213,4075297,3063504618316968426599,1372263056872621,7514001866134191512025247
%N A191624 Largest prime factor of n^n - n^(n-1) - n^(n-2) - ... - n^2 - n - 1.
%H A191624 Daniel Suteu and Harvey P. Dale, <a href="/A191624/b191624.txt">Table of n, a(n) for n = 3..72</a> (terms 3..52 from Harvey P. Dale)
%F A191624 a(n) = A006530(A191690(n)).
%p A191624 A006530 := proc(n) max ( numtheory[factorset](n) ) ;end proc:
%p A191624 A191690 := proc(n) n^n-add( n^j,j=0..n-1) ;end proc:
%p A191624 A191624 := proc(n) A006530(A191690(n)) ; end proc:
%p A191624 seq(A191624(n),n=3..15) ; # _R. J. Mathar_, Jun 23 2011
%t A191624 Table[With[{s=n^Range[0,n]},FactorInteger[Last[s]-Total[Most[s]]][[-1,1]]],{n,3,20}] (* _Harvey P. Dale_, Feb 02 2015 *)
%o A191624 (PARI) a(n) = if(n==0, return(1)); vecmax(factor(n^n - (n^n-1)/(n-1))[,1]); \\ _Daniel Suteu_, Jun 09 2022
%Y A191624 Cf. A006530, A191690.
%K A191624 nonn
%O A191624 3,1
%A A191624 _Juri-Stepan Gerasimov_, Jun 12 2011
%E A191624 More terms from _Harvey P. Dale_, Feb 02 2015