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 A076561 #13 Jan 06 2023 12:57:11
%S A076561 2,2,5,3,2,2,3,11,5,5,2,7,5,19,17,11,7,5,3,23,11,11,17,41,11,37,2,5,
%T A076561 17,47,13,5,19,53,11,47,7,5,11,17,29,71,19,7,13,59,53,101,5,11,31,83,
%U A076561 17,71,7,7,2,5,2,31,23,17,5,23,11,11,13,3,3,73,3,5,13,29,13,89,83,23,17
%N A076561 a(1)=2; a(n>1)= greatest prime divisor of {a(n-1) + n}.
%H A076561 Harvey P. Dale, <a href="/A076561/b076561.txt">Table of n, a(n) for n = 1..1000</a>
%t A076561 nxt[{n_,a_}]:={n+1,Max[FactorInteger[a+n+1][[All,1]]]}; NestList[nxt,{1,2},80][[All,2]] (* _Harvey P. Dale_, Jan 06 2023 *)
%o A076561 (PARI) lista(nn) = {v = vector(nn); v[1] = 2; for (n=2, nn, f = factor(v[n-1]+n); v[n] = f[#f~, 1];); v;} \\ _Michel Marcus_, Aug 08 2014
%Y A076561 Cf. A076560 (a(1)=1).
%K A076561 easy,nonn
%O A076561 1,1
%A A076561 _Zak Seidov_, Oct 19 2002
%E A076561 Definition clarified by _Harvey P. Dale_, Jan 06 2023