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 A051330 #28 Oct 24 2023 03:25:07
%S A051330 97,2,3,11,19,7,461,719,5,1411130344471,139,43,36599,1097,17,
%T A051330 104370954301,23,13,59,41,83,196777201807603861,569,31,149,131,
%U A051330 7408846366410141253195388029,29,27017,192228034594584553,307,2677,73,263,389,10463,61,47,617,743
%N A051330 Euclid-Mullin sequence (A000945) with initial value a(1)=97 instead of a(1)=2.
%H A051330 Tyler Busby, <a href="/A051330/b051330.txt">Table of n, a(n) for n = 1..51</a> (terms 1..45 from Robert Price)
%H A051330 Andrew R. Booker and Sean A. Irvine, <a href="http://arxiv.org/abs/1508.03039">The Euclid-Mullin graph</a>, arXiv preprint arXiv:1508.03039 [math.NT], 2015-2016.
%t A051330 a[1]=97; a[n_] := First[ Flatten[ FactorInteger[ 1+Product[ a[ j ], {j, 1, n-1} ] ] ] ]; Array[a, 10]
%o A051330 (PARI) lpf(n)=factor(n)[1, 1]
%o A051330 first(m)=my(v=vector(m)); v[1]=97; for(i=2, m, v[i]=lpf(1+prod(j=1, i-1, v[j]))); v; \\ _Anders Hellström_, Aug 31 2015
%Y A051330 Cf. A000945, A000946, A005265, A005266.
%K A051330 easy,nonn
%O A051330 1,1
%A A051330 _Labos Elemer_
%E A051330 a(34)-a(45) from _Robert Price_, Jul 20 2015