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 A051331 #19 Nov 25 2015 14:49:35
%S A051331 131071,2,3,43,31,113,5,13,4391,7,8012161,3090097,17,809,83843,18743,
%T A051331 29,179,2347,83,97883,14411,12109,97,25951,
%U A051331 5506100565736709510249607377685096261432096111292821492562747465234861171
%N A051331 Euclid-Mullin sequence (A000945) with initial value a(1)=131071 instead of a(1)=2.
%H A051331 Robert Price, <a href="/A051331/b051331.txt">Table of n, a(n) for n = 1..36</a>
%t A051331 a[1]=131071; a[n_] := First[ Flatten[ FactorInteger[ 1+Product[ a[ j ], {j, 1, n-1} ] ] ] ]; Array[a, 10]
%o A051331 (PARI) gpf(n)=my(f=factor(n)[, 1]); f[#f];
%o A051331 first(m)=my(v=vector(m)); v[1]=131071; for(i=2, m, v[i]=gpf(1+prod(j=1, i-1, v[j]))); v \\ _Anders Hellström_, Nov 25 2015
%Y A051331 Cf. A000945, A000946, A005265, A005266.
%K A051331 easy,nonn
%O A051331 1,1
%A A051331 _Labos Elemer_