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 A051322 #21 Oct 09 2023 14:30:26
%S A051322 61,2,3,367,7,5,1217,17,13,59,3271,19,11,76938833,337,10711,1021,31,
%T A051322 83,1290503,15608141,195648590992627,109,
%U A051322 15983112328343713807564263439978033717550587578630760604057976854157331
%N A051322 Euclid-Mullin sequence (A000945) with initial value a(1)=61 instead of a(1)=2.
%H A051322 Tyler Busby, <a href="/A051322/b051322.txt">Table of n, a(n) for n = 1..42</a> (terms 1..33 from Robert Price)
%t A051322 a[1]=61; a[n_] := First[ Flatten[ FactorInteger[ 1+Product[ a[ j ], {j, 1, n-1} ] ] ] ]; Array[a, 10]
%o A051322 (PARI) spf(n)=my(f=factor(n)[1, 1]); f
%o A051322 first(m)=my(v=vector(m)); v[1]=61; for(i=2, m, v[i]=spf(1+prod(j=1, i-1, v[j]))); v \\ _Anders Hellström_, Dec 04 2015
%Y A051322 Cf. A000945, A000946, A005265, A005266.
%K A051322 nonn
%O A051322 1,1
%A A051322 _Labos Elemer_