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 A076567 #18 Nov 10 2020 17:15:11
%S A076567 5,7,3,11,13,5,17,19,7,23,5,3,29,31,11,7,37,13,41,43,5,47,7,17,53,11,
%T A076567 19,59,61,7,13,67,23,71,73,5,11,79,3,83,17,29,89,13,31,19,97,11,101,
%U A076567 103,7,107,109,37,113,23,13,17,11,41,5,127,43,131,19,5,137,139,47,13
%N A076567 Greatest prime divisor of 4n+6 (sum of four successive integers).
%H A076567 Robert Israel, <a href="/A076567/b076567.txt">Table of n, a(n) for n = 1..10000</a>
%F A076567 a(n) = A076565(n+1) = A006530(4n+6). - _R. J. Mathar_, Jul 31 2008
%p A076567 f:= n -> max(numtheory:-factorset(n)):
%p A076567 map(f, [seq(i,i=10..1000,4)]); # _Robert Israel_, Nov 10 2020
%t A076567 FactorInteger[#][[-1,1]]&/@(4*Range[70]+6) (* _Harvey P. Dale_, Mar 12 2017 *)
%o A076567 (PARI) a(n) = {f = factor(4*n+6); return (f[length(f~), 1]);} \\ _Michel Marcus_, Apr 19 2013
%o A076567 (PARI) a(n) = vecmax(factor(4*n+6)[,1]); \\ _Michel Marcus_, Nov 10 2020
%Y A076567 Cf. A006530, A076565.
%K A076567 easy,nonn
%O A076567 1,1
%A A076567 _Zak Seidov_, Oct 19 2002