Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Jun 30 2015 11:06:53
%S 7,70,720,7102,70780,704537,7026559,70122424,700184485,6993568566,
%T 69870544960,698175242376
%N a(n) = number of distinct prime divisors (taken together) of numbers of the form x^2+1 for x<=10^n.
%H Bernhard Helmes, <a href="http://www.devalco.de/quadr_Sieb_x%5E2+1.php#4a">Prime sieving on the polynomial f(n)=n^2+1</a>.
%t d = 10; l = 0; p = 1; 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 For primes of the form n^2+1 see A002496.
%Y Cf. A002496, A143835, A143868, A144850, A144851.
%K nonn
%O 1,1
%A _Artur Jasinski_ & Bernhard Helmes (bhelmes(AT)gmx.de), Sep 22 2008, Sep 24 2008
%E Fixed broken link and extended to agree with website. - _Ray Chandler_, Jun 30 2015