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 A051309 #22 Jan 13 2024 11:47:00
%S A051309 11,2,23,3,7,10627,433,17,13,10805892983887,73,6397,19,489407,2753,
%T A051309 87491,18618443,5,31,113,41,10723,35101153,25243,374399,966011,
%U A051309 293821591198219762366057,234947,4729,27953,3256171,331,613,67,272646324430637,34281113,21050393332691947013,61,97
%N A051309 Euclid-Mullin sequence (A000945) with initial value a(1)=11 instead of a(1)=2.
%H A051309 A. R. Booker and S. 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 A051309 a[1]=11; a[n_] := First[ Flatten[ FactorInteger[ 1+Product[ a[ j ], {j, 1, n-1} ] ] ] ]; Array[a,10]
%o A051309 (PARI) lpf(n)=factor(n)[1,1]
%o A051309 first(m)=my(v=vector(m)); v[1]=11; for(i=2, m, v[i]=lpf(1+prod(j=1, i-1, v[j]))); v;
%o A051309 \\ _Anders Hellström_, Aug 22 2015
%Y A051309 Cf. A000945, A000946, A005265, A005266.
%K A051309 nonn
%O A051309 1,1
%A A051309 _Labos Elemer_
%E A051309 Corrected and extended by _Sean A. Irvine_, Apr 13 2008