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 A065316 #40 Jan 01 2025 18:27:46
%S A065316 23,199,2297,30013,12451,9699667,79139,122069683,9241993,77184383,
%T A065316 211941187,72280449346243,73629553,142226610221,131076443530861861,
%U A065316 382046844818915214929,1348764323657,1822793973448088839487,217379667530071,3217644767340672907899084554047,267064515689275851355624017992701
%N A065316 Largest prime divisor of n-th primorial - (n+1)-st prime.
%H A065316 Tyler Busby, <a href="/A065316/b065316.txt">Table of n, a(n) for n = 3..89</a> (terms 3..80 from Sean A. Irvine)
%H A065316 Romeo Mestrovic, <a href="http://arxiv.org/abs/1202.3670">Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 BC--2012) and another new proof</a>, arXiv preprint arXiv:1202.3670 [math.HO], 2012-2023. - From _N. J. A. Sloane_, Jun 13 2012
%F A065316 a(n) = A006530(A002110(n)-A000040(n+1)).
%e A065316 For n=3, 3rd primorial=30, 4th prime=7, difference=23, so a(3)=23.
%t A065316 Module[{nn=30,pmrl},pmrl=FoldList[Times,Prime[Range[nn]]];FactorInteger[ #][[-1,1]]&/@(Drop[#[[1]]-#[[2]]&/@Thread[ {pmrl,Prime[ Range[ 2,nn+1]]}],2])] (* _Harvey P. Dale_, Dec 30 2021 *)
%o A065316 (PARI) a(n) = vecmax(factor(prod(i=1, n, prime(i)) - prime(n+1))[,1]); \\ _Michel Marcus_, Aug 29 2019
%Y A065316 Cf. A002110, A000040, A006530, A006530, A057713, A002584, A002585, A051342.
%Y A065316 See also A065314, A065315, A065317.
%K A065316 nonn
%O A065316 3,1
%A A065316 _Labos Elemer_, Oct 29 2001
%E A065316 More terms from _Michel Marcus_, Aug 29 2019