cp's OEIS Frontend

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.

Showing 1-3 of 3 results.

A221712 Hardy-Littlewood constant for x^2+x+41.

Original entry on oeis.org

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

Views

Author

N. J. A. Sloane, Jan 26 2013

Keywords

Examples

			3.31977317747142166532355685764988796646855...
		

References

  • Henri Cohen, Number Theory, Vol II: Analytic and Modern Tools, Springer (Graduate Texts in Mathematics 240), 2007.
  • Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See pp. 265-266.

Crossrefs

Programs

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

Extensions

More terms from Hugo Pfoertner, Jan 31 2020

A331876 Number of primes of the form P(k) = k^2 + k + 41 for k <= 10^n, where P(k) is Euler's prime-generating polynomial A202018.

Original entry on oeis.org

2, 11, 87, 582, 4149, 31985, 261081, 2208197, 19132653, 168806741, 1510676803
Offset: 0

Views

Author

Hugo Pfoertner, Jan 30 2020

Keywords

Examples

			a(0) = 2 because 41 and 43 are the 2 primes generated for k <= 1 = 10^0.
a(1) = 11 because 41, 43, 47, 53, 61, 71, 83, 97, 113, 131, 151 are the 11 primes generated for k <= 10^1, (A202018(10) = 151).
a(3) = 87 because 87 terms of A202018(0..100) are prime. The 14 composites occur for k = A007634(1..14): 40, 41, 44, 49, 56, ...
		

Crossrefs

Programs

  • PARI
    n=0;m=1;for(k=0,10^7,my(j=k^2+k+41);if(isprime(j),n++);if(k==m,m*=10;print1(n,", ")))

A331877 a(n) = number of primes of the form P(k) = k^2 + k + 41 for k <= 10^n as predicted by the Hardy and Littlewood Conjecture F, rounded to nearest integer. The actual number of primes is A331876(n).

Original entry on oeis.org

17, 97, 586, 4133, 31965, 261022, 2207375, 19129225, 168807923, 1510681420, 13671046376, 124849864598, 1148859448601, 10639680705031, 99077207876785
Offset: 1

Views

Author

Hugo Pfoertner, Jan 30 2020

Keywords

References

Crossrefs

Programs

  • PARI
    C=3.31977317747142166532355685764988796646855; for(n=1,15,print1(round(C*intnum(x=2,10^n,1/log(x))),", "))

Formula

b(m) = round (C * Integral_{x=2..m} x/log(x) dx), with C ~= 3.319773177471..., the Hardy-Littlewood constant for k^2+k+41 (A221712); a(n) = b(10^n).
Showing 1-3 of 3 results.