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 A252489 #17 Dec 05 2023 19:47:05
%S A252489 1,2,2,3,3,4,4,2,3,5,5,6,6,4,3,7,7,8,8,4,5,9,9,3,6,6,4,10,10,11,11,5,
%T A252489 7,7,4,12,12,8,6,13,13,14,14,5,9,15,15,4,4,7,7,16,16,5,5,8,10,17,17,
%U A252489 18,18,11,4,6,6,19,19,9,9,20,20,21,21,12,8,8,6
%N A252489 Index of the largest prime which divides n*(n+1).
%C A252489 Yields the row of A145605 in which n appears, and also the first row of A138180 in which n appears.
%H A252489 Robert Israel, <a href="/A252489/b252489.txt">Table of n, a(n) for n = 1..10000</a>
%F A252489 a(n) = pi(A074399(n)), where pi = A000720.
%F A252489 a(n) = max(A061395(n),A061395(n+1)). - _Robert Israel_, Feb 12 2021
%p A252489 A061395:= [1, seq(numtheory:-pi(max(numtheory:-factorset(n))), n=2..101)]:
%p A252489 zip(max,A061395[1..-2],A061395[2..-1]); # _Robert Israel_, Feb 12 2021
%t A252489 a[n_] := PrimePi[Max[FactorInteger[n][[-1, 1]], FactorInteger[n+1][[-1, 1]]]];
%t A252489 Table[a[n], {n, 1, 100}] (* _Jean-François Alcover_, Dec 05 2023 *)
%o A252489 (PARI) a(n)=primepi(vecmax(factor(n*(n+1))[,1]))
%Y A252489 Cf. A002071, A145604, A138180, A145605, A002072, A074399, A061395.
%K A252489 nonn,look
%O A252489 1,2
%A A252489 _M. F. Hasler_, Jan 16 2015