A331942 -id:A331942 - cp's OEIS frontend

A206709 Number of primes of the form b^2 + 1 for b <= 10^n.

5, 19, 112, 841, 6656, 54110, 456362, 3954181, 34900213, 312357934, 2826683630, 25814570672, 237542444180, 2199894223892

Offset: 1

Michel Lagneau, Feb 13 2012

Conjecture: The number of primes of the form b^2 + 1 and less than n is asymptotic to 3*n/(4*log(n)).
Examples:
n = 10^3, a(n) = 112 and 3*10^3/(4*log(10^3)) = 108.573...;
n = 10^4, a(n) = 841 and 3*10^4/(4*log(10^4)) = 814.302...;
n = 10^10, a(n) = 312357934 and 3*10^10/(4*log(10^10)) = 325720861.42...
a(n) = A083844(2*n), but not always! The only known exception to this rule is at n = 1. - Arkadiusz Wesolowski, Jul 21 2012
From Jacques Tramu, Sep 14 2018: (Start)
In the table below, K = 0.686413 and pi(10^n) = A000720(10^n):
.
   n         a(n)   K*pi(10^n)
  ==  ===========  ===========
   1            5            3
   2           19           17
   3          112          115
   4          841          843
   5         6656         6584
   6        54110        53882
   7       456362       456175
   8      3954181      3954737
   9     34900213     34902408
  10    312357934    312353959
  11   2826683630   2826686358
  12  25814570672  25814559712
(End)
For a comparison with the estimate that results from the Hardy and Littlewood Conjecture F, see A331942. - Hugo Pfoertner, Feb 03 2020

			a(2) = 19 because there are 19 primes of the form b^2 + 1 for b less than 10^2: 2, 5, 17, 37, 101, 197, 257, 401, 577, 677, 1297, 1601, 2917, 3137, 4357, 5477, 7057, 8101 and 8837.

Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See p. 264.

Soren Laing Aletheia-Zomlefer, Lenny Fukshansky, and Stephan Ramon Garcia, The Bateman-Horn Conjecture: Heuristics, History, and Applications, arXiv:1807.08899 [math.NT], 2018-2019. See Table 2. p. 8.
Marek Wolf, Search for primes of the form m^2+1, arXiv:0803.1456 [math.NT], 2008-2010.

Cf. A002496, A083844, A215047, A331941, A331942.

for n from 1 to 9 do : i:=0:for m from 1 to 10^n do:x:=m^2+1:if type(x,prime)=true then i:=i+1:else fi:od: printf ( "%d %d \n",n,i):od:

1 + Accumulate@ Array[Count[Range[10^(# - 1) + 1, 10^#], ?(PrimeQ[#^2 + 1] &)] &, 7] (* _Michael De Vlieger, Sep 18 2018 *)

a(n)=sum(n=1,10^n,ispseudoprime(n^2+1)) \\ Charles R Greathouse IV, Feb 13 2012

from sympy import isprime
def A206709(n):
    c, b, b2, n10 = 0, 1, 2, 10**n
    while b <= n10:
        if isprime(b2):
            c += 1
        b += 1
        b2 += 2*b - 1
    return c # Chai Wah Wu, Sep 17 2018

a(11)-a(12) from Arkadiusz Wesolowski, Jul 21 2012

a(13)-a(14) from Jinyuan Wang, Feb 24 2020

A199401 Decimal expansion of constant Product_{p>=3} (1 - (-1)^((p-1)/2)/(p-1)). Hardy-Littlewood constant of x^2 + 1.

Original entry on oeis.org

1, 3, 7, 2, 8, 1, 3, 4, 6, 2, 8, 1, 8, 2, 4, 6, 0, 0, 9, 1, 1, 2, 1, 9, 2, 6, 9, 6, 7, 2, 7, 0, 1, 8, 8, 6, 8, 1, 7, 8, 3, 3, 3, 1, 0, 1, 2, 5, 5, 7, 5, 9, 5, 5, 7, 9, 3, 6, 2, 3, 4, 1, 4, 7, 3, 2, 7, 8, 4, 2, 2, 2, 6, 7, 1, 7, 3, 7, 0, 2, 3, 1, 7, 2, 7, 7, 1

Offset: 1

N. J. A. Sloane, Nov 05 2011

Arises in studying A002496.

The constant is Product_{primes p} (1-chi(p)/(p-1)) where chi is the Dirichlet character A101455. Its Euler expansion is (1/(L(m=4,r=2,s=1)* zeta(m=4,n=3,s=2)) *Product_{s>=2} zeta(m=4,n=1,s)^gamma(s), where L and zeta are the functions tabulated in arXiv:1008.2547 and gamma is the sequence A001037. In particular L(m=4,r=2,s=1) = A003881 and zeta(m=4,n=1,s=2)=A175647. - R. J. Mathar, Nov 29 2011

			1.372813462818246009112192696727...

Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, vol. 94, Cambridge University Press, 2003, Section 2.1, p. 85.
Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See p. 264.

T. Amdeberhan, L. A. Median, and V. H. Moll, Arithmetical properties of a sequence arising from an arctangent sum, J. Numb. Theory 128 (2008) 1807-1846, eq. (1.10).
Karim Belabas and Henri Cohen, Computation of the Hardy-Littlewood constant for quadratic polynomials, PARI/GP script, 2020.
Henri Cohen, High-precision computation of Hardy-Littlewood constants, (1998). [pdf copy, with permission]
G. H. Hardy and J. E. Littlewood, Some problems of 'Partitio numerorum'; III: On the expression of a number as a sum of primes, Acta Math., Vol. 44, No. 1 (1923), pp. 1-70. See Section 5.41.
Richard J. Mathar, Table of Dirichlet L-Series and Prime Zeta Modulo Functions for Small Moduli, arXiv:1008.2547 [math.NT], 2010-2015.
Marek Wolf, Search for primes of the form m^2+1, arXiv:0803.1456 [math.NT], 2008-2010.

Cf. A002496.
Cf. A001037, A003881, A083844, A175647, A221712, A331942.
Equals 2*constant given by A331941.

\\ See Belabas, Cohen link. Run as HardyLittlewood2(x^2+1) after setting the required precision.

Extended title, a(30) and beyond from Hugo Pfoertner, Feb 16 2020

cp's OEIS Frontend

A206709 Number of primes of the form b^2 + 1 for b <= 10^n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Extensions