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 A051332 #45 Mar 06 2024 19:41:36
%S A051332 65537,2,5,3,7,11,61,13,120052642711,157,8837,71,3271,31,37,19,8597,
%T A051332 8868542017,23,149,
%U A051332 26443389827415776296437975011182059459845296976025400711,97,751,17,280121,4999,8797543,12241,29,53,197,5659,3109,1063,727915549
%N A051332 Euclid-Mullin sequence (A000945) with initial value a(1)=65537 instead of a(1)=2.
%H A051332 Tyler Busby, <a href="/A051332/b051332.txt">Table of n, a(n) for n = 1..70</a>
%t A051332 a[1]=65537; a[n_] := First[ Flatten[ FactorInteger[ 1+Product[ a[ j ], {j, 1, n-1} ] ] ] ]; Array[a, 10]
%o A051332 (PARI) spf(n)=my(f=factor(n)[1, 1]); f \\ A020639
%o A051332 first(m)=my(v=vector(m)); v[1]=65537; for(i=2, m, v[i]=spf(1+prod(j=1, i-1, v[j]))); v \\ _Anders Hellström_, Dec 07 2015
%Y A051332 Cf. A020639, A000945, A000946, A005265, A005266.
%K A051332 nonn
%O A051332 1,1
%A A051332 _Labos Elemer_
%E A051332 a(25)-a(35) from _Robert Price_, Jul 09 2015