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 A051323 #21 Oct 10 2023 17:49:17
%S A051323 67,2,3,13,5227,7,5,4637,107,23,1889,50929,31,1677554191669,538282187,
%T A051323 59,37,17046661,81088366624779421,11,
%U A051323 6242880316142699576539967984792911,73,17,1187,101,883,3491,47,83,852851,317,1493,579707,109,1579145715181,179,1618489,331
%N A051323 Euclid-Mullin sequence (A000945) with initial value a(1)=67 instead of a(1)=2.
%H A051323 Tyler Busby, <a href="/A051323/b051323.txt">Table of n, a(n) for n = 1..42</a>
%t A051323 a[1]=67; a[n_] := First[ Flatten[ FactorInteger[ 1+Product[ a[ j ], {j, 1, n-1} ] ] ] ]; Array[a, 10]
%o A051323 (PARI) spf(n)=my(f=factor(n)[1, 1]); f
%o A051323 first(m)=my(v=vector(m)); v[1]=67; for(i=2, m, v[i]=spf(1+prod(j=1, i-1, v[j]))); v \\ _Anders Hellström_, Dec 06 2015
%Y A051323 Cf. A000945, A000946, A005265, A005266.
%K A051323 nonn
%O A051323 1,1
%A A051323 _Labos Elemer_
%E A051323 a(21)-a(38) from _Robert Price_, Jul 12 2015