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 A007014 M1546 #30 Jul 18 2023 06:51:29
%S A007014 2,5,29,199,2309,30029,510481,9699667,223092827,6469693189,
%T A007014 200560490057,7420738134751,304250263527209,13082761331669941,
%U A007014 614889782588491343,32589158477190044657,1922760350154212638963,117288381359406970983181,7858321551080267055878989
%N A007014 Largest prime <= Product prime(k).
%C A007014 A057705 contains terms of a(n) such that A002110(n) - a(n) = 1. -_Michael De Vlieger_, May 15 2017
%D A007014 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A007014 Michael De Vlieger, <a href="/A007014/b007014.txt">Table of n, a(n) for n = 1..350</a>
%H A007014 R. G. Wilson, V, <a href="/A007014/a007014.pdf">Letter to N. J. A. Sloane, Jan. 1994</a>
%F A007014 From _Michael De Vlieger_, May 15 2017: (Start)
%F A007014 a(n) = prime(A000849(n)).
%F A007014 a(n) = A151799(A002110(n)). (End)
%e A007014 From _Michael De Vlieger_, May 15 2017: (Start)
%e A007014 a(1) = 2 since A002110(1) = 2. 2 is prime thus the largest prime <= 2 = 2.
%e A007014 a(2) = 5 since A002110(2) = 6. 5 is the largest prime <= 6. (End)
%t A007014 Array[Abs@ NextPrime[Product[Prime@ i, {i, #}], -1] &, 14] (* _Michael De Vlieger_, May 15 2017 *)
%o A007014 (PARI) lista(n) = {prd = 1; for (i=1, n, prd *= prime(i); print1(precprime(prd), ", "););} \\ _Michel Marcus_, Jun 17 2013
%o A007014 (PARI) a(n)=precprime(prod(i=1,n,prime(i))) \\ _Charles R Greathouse IV_, Jun 17 2013
%Y A007014 Cf. A000849, A002110, A038710, A057705, A151799.
%K A007014 nonn
%O A007014 1,1
%A A007014 _N. J. A. Sloane_, _Mira Bernstein_, _Robert G. Wilson v_
%E A007014 Corrected by _Jud McCranie_, Jan 03 2001
%E A007014 More terms from _Michael De Vlieger_, May 15 2017