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 A051321 #17 Dec 05 2015 00:03:04
%S A051321 59,2,7,827,3,13,4583,5,610478010871,61,292658543,4483,47,11,31,43,
%T A051321 16453,41,3671,1982639,628319,841476613,449,997793,73,983,53,28475917,
%U A051321 19,673
%N A051321 Euclid-Mullin sequence (A000945) with initial value a(1)=59 instead of a(1)=2.
%H A051321 Robert Price, <a href="/A051321/b051321.txt">Table of n, a(n) for n = 1..48</a>
%t A051321 a[1]=59; a[n_] := First[ Flatten[ FactorInteger[ 1+Product[ a[ j ], {j, 1, n-1} ] ] ] ]; Array[a, 10]
%o A051321 (PARI) spf(n)=my(f=factor(n)[1, 1]); f
%o A051321 first(m)=my(v=vector(m)); v[1]=59; for(i=2, m, v[i]=spf(1+prod(j=1, i-1, v[j]))); v \\ _Anders Hellström_, Dec 04 2015
%Y A051321 Cf. A000945, A000946, A005265, A005266.
%K A051321 easy,nonn
%O A051321 1,1
%A A051321 _Labos Elemer_
%E A051321 a(28)-a(48) from _Robert Price_, Jul 13 2015