A331948 -id:A331948 - cp's OEIS frontend

A331946 Factors k > 0 such that k*x^2 + 1 produces a new minimum of its Hardy-Littlewood constant.

1, 5, 11, 17, 29, 41, 89, 101, 461, 521, 761, 941, 1091, 1361, 1889, 2141, 3449, 4289, 5381, 5561, 10709, 15461, 23201, 59309, 70769, 134741, 174929, 329969, 493349

Offset: 1

Hugo Pfoertner, Feb 10 2020

a(30) > 600000.
See A331940 for more information on the Hardy-Littlewood constant. The polynomials described by this sequence are increasingly prime-avoiding.
The following table provides the minimum record values of C, together with the number of primes np generated by the polynomial P(x) = a(n)*x^2 + 1 for x <= r = 10^8 and the actual ratio np*(P(r)/r)/Integral_{x=2..P(r)} 1/log(x) dx.
    a(n)    C       np    C from ratio
       1 1.37281  3954181 1.41606
       5 0.66031  1816520 0.67979
      11 0.56115  1512897 0.57810
      17 0.52244  1392498 0.53816
      .. .......   ...... .......
  329969 0.20443   430342 0.20883
  493349 0.20348   424719 0.20781

Henri Cohen, Number Theory, Volume II: Analytic and Modern Tools, GTM Vol. 240, Springer, 2007; see pp. 208-209.

Karim Belabas, Henri Cohen, Computation of the Hardy-Littlewood constant for quadratic polynomials, PARI/GP script, 2020.
Henri Cohen, High precision computation of Hardy-Littlewood constants, preprint, 1998. [pdf copy, with permission]

Cf. A221712, A331940, A331945, A331947, A331948.

A331945 Factors k > 0 such that the polynomial k*x^2 + 1 produces a record of its Hardy-Littlewood constant.

Original entry on oeis.org

1, 2, 3, 4, 12, 18, 28, 58, 190, 462, 708, 5460, 10602, 39292, 141100, 249582, 288502

Offset: 1

Hugo Pfoertner, Feb 10 2020

a(18) > 510000.
See A331940 for more information on the Hardy-Littlewood constant. The polynomials described by this sequence have an increasing rate of generating primes.
The following table provides the record values of the Hardy-Littlewood constant C, together with the number of primes np generated by the polynomial P(x) = a(n)*x^2 + 1 for 1 <= x <= r = 10^8 and the actual ratio np*(P(r)/r)/Integral_{x=2..P(r)} 1/log(x) dx.
    a(n)    C        np    C from ratio
       1 1.37281  3954181  1.41606 (C = A199401)
       2 1.42613  4027074  1.47010
       3 1.68110  4696044  1.73337
       4 2.74563  7605407  2.82915
      12 3.36220  9037790  3.46135
      .. .......  .......  .......
  249582 7.90518 16760196  8.08633
  288502 8.21709 17367067  8.40431

Henri Cohen, Number Theory, Volume II: Analytic and Modern Tools, GTM Vol. 240, Springer, 2007; see pp. 208-209.

Karim Belabas, Henri Cohen, Computation of the Hardy-Littlewood constant for quadratic polynomials, PARI/GP script, 2020.
Henri Cohen, High precision computation of Hardy-Littlewood constants, preprint, 1998. [pdf copy, with permission]

Cf. A199401, A221712, A331940, A331941, A331946, A331948, A331948, A331949.

A331947 Factors k > 1 such that the polynomial k*x^2 - 1 produces a record of its Hardy-Littlewood constant.

Original entry on oeis.org

2, 12, 20, 68, 90, 98, 132, 252, 318, 362, 398, 1722, 259668, 315180, 452042

Offset: 1

Hugo Pfoertner, Feb 10 2020

a(16) > 710000.
See A331940 for more information on the Hardy-Littlewood constant. The polynomials described by this sequence have an increasing rate of generating primes.
The following table provides the record values of the Hardy-Littlewood constant C, together with the number of primes np generated by the polynomial P(x) = a(n)*x^2 - 1 for 2 <= x <= r = 10^8 and the actual ratio np*(P(r)/r)/Integral_{x=2..P(r)} 1/log(x) dx.
    a(n)    C        np    C from ratio
       2 3.70011  10448345 3.81422
      12 4.15027  11154934 4.27219
      20 4.43326  11753085 4.56136
      68 5.01601  12883801 5.15797
      .. .......  ........ .......
  315180 7.82318  16502584 8.00057
  452042 7.85323  16434699 8.02696

Henri Cohen, Number Theory, Volume II: Analytic and Modern Tools, GTM Vol. 240, Springer, 2007; see pp. 208-209.

Karim Belabas, Henri Cohen, Computation of the Hardy-Littlewood constant for quadratic polynomials, PARI/GP script, 2020.
Henri Cohen, High precision computation of Hardy-Littlewood constants, preprint, 1998. [pdf copy, with permission]

Cf. A221712, A331940, A331941, A331945, A331946, A331948, A331949.

A332707 Factors k > 2 such that the polynomial x^2 + k*x + 1 produces a new minimum of its Hardy-Littlewood constant.

Original entry on oeis.org

3, 4, 8, 20, 40, 230, 260, 680, 1910, 2120, 6670, 9710, 10310, 23500, 25220, 37990, 71800

Offset: 1

Hugo Pfoertner, Feb 20 2020

a(18) > 100000.
See A331940 for more information on the Hardy-Littlewood constant. The polynomials described by this sequence are increasingly avoiding primes.
The following table provides the minimum values of the Hardy-Littlewood constant C, together with the number of primes np generated by the polynomial P(x) = x^2 + a(n)*x + 1 for 1 <= x <= r = 10^8 and the actual ratio np*(P(r)/r)/Integral_{x=2..P(r)} 1/log(x) dx.
   a(n)     C       np    C from ratio
      3  3.54661 10220078 3.65998
      4  1.38342  3982973 1.42637
      8  0.91172  2627239 0.94086
     20  0.76532  2204290 0.78939
  .....  .......  ....... .......
  25220  0.39947  1151122 0.41224
  37990  0.39945  1151126 0.41224

Henri Cohen, Number Theory, Volume II: Analytic and Modern Tools, GTM Vol. 240, Springer, 2007; see pp. 208-209.

Karim Belabas, Henri Cohen, Computation of the Hardy-Littlewood constant for quadratic polynomials, PARI/GP script, 2020.
Henri Cohen, High precision computation of Hardy-Littlewood constants, preprint, 1998. [pdf copy, with permission]

Cf. A221712, A331940, A331945, A331946, A331947, A331948, A331949, A332708.

A332708 Factors k >= 0 such that the polynomial x^2 + k*x + 1 produces a record of its Hardy-Littlewood constant.

Original entry on oeis.org

1, 3, 21, 231, 879, 1011, 1089, 1659, 2751

Offset: 1

Hugo Pfoertner, Feb 20 2020

a(10) > 80000.
See A331940 for more information on the Hardy-Littlewood constant. The polynomials described by this sequence have an increasing rate of generating primes.
The following table provides the record values of the Hardy-Littlewood constant C, together with the number of primes np generated by the polynomial P(x) = x^2 + a(n)*x + 1 for 1 <= x <= r = 10^8 and the actual ratio np*(P(r)/r)/Integral_{x=2..P(r)} 1/log(x) dx.
  a(n)     C       np    C from ratio
     1  2.24147  6456835 2.31230
     3  3.54661 10220078 3.65998
    21  5.58679 16096923 5.76458
   231  5.74156 16543757 5.92460
   879  5.83722 16813676 6.02126
  1011  5.92725 17073610 6.11435
  1089  6.03701 17392675 6.22861
  1659  6.04359 17413761 6.23617
  2751  7.46622 21508374 7.70252

Henri Cohen, Number Theory, Volume II: Analytic and Modern Tools, GTM Vol. 240, Springer, 2007; see pp. 208-209.

Karim Belabas, Henri Cohen, Computation of the Hardy-Littlewood constant for quadratic polynomials, PARI/GP script, 2020.
Henri Cohen, High precision computation of Hardy-Littlewood constants, preprint, 1998. [pdf copy, with permission]

Cf. A221712, A331940, A331945, A331946, A331947, A331948, A331949, A332707.

cp's OEIS Frontend

A331946 Factors k > 0 such that k*x^2 + 1 produces a new minimum of its Hardy-Littlewood constant.

Views

Author

Keywords

Comments

References

Links

Crossrefs

A331945 Factors k > 0 such that the polynomial k*x^2 + 1 produces a record of its Hardy-Littlewood constant.

Views

Author

Keywords

Comments

References

Links

Crossrefs

A331947 Factors k > 1 such that the polynomial k*x^2 - 1 produces a record of its Hardy-Littlewood constant.

Views

Author

Keywords

Comments

References

Links

Crossrefs

A332707 Factors k > 2 such that the polynomial x^2 + k*x + 1 produces a new minimum of its Hardy-Littlewood constant.

Views

Author

Keywords

Comments

References

Links

Crossrefs

A332708 Factors k >= 0 such that the polynomial x^2 + k*x + 1 produces a record of its Hardy-Littlewood constant.

Views

Author

Keywords

Comments

References

Links

Crossrefs