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 A060358 #20 Feb 17 2024 20:27:49
%S A060358 5,11,59,59,419,839,2503,2503,27701,27701,360337,360337,360337,720703,
%T A060358 12252197,12252197,232792559,232792559,232792559,232792559,5354228879,
%U A060358 5354228879,26771144371,26771144371,80313433159,80313433159,2329089562799,2329089562799
%N A060358 a(n) = largest prime < lcm(1..n).
%H A060358 Chai Wah Wu, <a href="/A060358/b060358.txt">Table of n, a(n) for n = 3..2308</a>
%p A060358 b:= proc(n) option remember; `if`(n=0, 1, ilcm(n, b(n-1))) end:
%p A060358 a:= n-> prevprime(b(n)):
%p A060358 seq(a(n), n=3..30); # _Alois P. Heinz_, Feb 17 2024
%t A060358 Table[NextPrime[LCM@@Range[n],-1],{n,3,30}] (* _Harvey P. Dale_, May 28 2014 *)
%o A060358 (PARI) a(n) = precprime(lcm([1..n])); \\ _Michel Marcus_, Mar 18 2018
%o A060358 (Python)
%o A060358 from sympy import prevprime, lcm
%o A060358 def A060358(n):
%o A060358 return prevprime(lcm(range(1,n+1))) # _Chai Wah Wu_, Jan 22 2020
%Y A060358 Cf. A003418, A060357.
%K A060358 nonn
%O A060358 3,1
%A A060358 _N. J. A. Sloane_, Apr 01 2001