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 A333537 #26 Aug 17 2020 22:26:25
%S A333537 3,3,3,2,5,3,3,3,5,5,3,3,5,5,5,3,3,3,3,3,7,5,5,5,5,7,7,7,3,3,5,5,5,5,
%T A333537 5,5,5,5,5,3,3,3,3,3,3,7,7,7,7,5,5,5,5,5,5,7,7,7,7,7,7,7,7,3,3,3,5,5,
%U A333537 5,5,5,5,5,5,7,7,7,5,5,5,5,5,5,5,3,3,3,3,5,5,13,7,7,7,7,7,7,7,3,7,7,7,7,7,7,5
%N A333537 Greatest prime factor of A332559.
%C A333537 For rate of growth, see the Myers et al. link. - _N. J. A. Sloane_, Apr 30 2020
%H A333537 N. J. A. Sloane, <a href="/A333537/b333537.txt">Table of n, a(n) for n = 1..10000</a>.
%H A333537 J. S. Myers, R. Schroeppel, S. R. Shannon, N. J. A. Sloane, and P. Zimmermann, <a href="http://arxiv.org/abs/2004.14000">Three Cousins of Recaman's Sequence</a>, arXiv:2004:14000 [math.NT], April 2020.
%t A333537 a[n_] := Module[{k, p = n}, For[k = 1, True, k++, p *= (n+k); If[Divisible[ p, n+k+1], Return[FactorInteger[n+k+1][[-1, 1]]]]]];
%t A333537 Array[a, 1000] (* _Jean-François Alcover_, Aug 17 2020 *)
%Y A333537 Cf. A006530, A061836, A332558, A332559, A332560, A332561.
%Y A333537 For records see A333538, A333541, A333542.
%K A333537 nonn
%O A333537 1,1
%A A333537 _N. J. A. Sloane_, Apr 12 2020