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 A144851 #13 Jun 30 2015 11:05:58
%S A144851 8,76,760,7445,73477,726948,7218256,71801859,715087632,7127665635,
%T A144851 71089166879,709344259821
%N A144851 a(n) = number of distinct prime divisors (taken together) of numbers of the form 2x^2+1 for x<=10^n.
%H A144851 Bernhard Helmes, <a href="http://www.devalco.de/quadr_Sieb_2x%5E2+1.php#4a">Prime sieving on the polynomial f(n)=2n^2+1</a>.
%t A144851 d = 10; l = 0; p = 2; c = {}; a = {}; Do[k = p x^2 + 1; b = Divisors[k]; Do[If[PrimeQ[b[[n]]], AppendTo[a, b[[n]]]], {n, 1, Length[b]}]; If[x == d, a = Union[a]; l = Length[a]; d = 10 d; Print[l]; AppendTo[c, l]], {x, 1, 10000}]; c (*_Artur Jasinski_*)
%Y A144851 Cf. A002383, A143835, A143868, A144848, A144850.
%K A144851 nonn
%O A144851 1,1
%A A144851 _Artur Jasinski_ & Bernhard Helmes (bhelmes(AT)gmx.de), Sep 22 2008
%E A144851 Fixed broken link, corrected and extended to agree with website. - _Ray Chandler_, Jun 30 2015