The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A140454 Number of primes p less than 10^n such that p^2-2 is prime. 2
 4, 13, 52, 259, 1595, 10548, 74914, 563533, 4387106 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Korevaar gives these values in Table 1, p. 18, attributing the calculation to Fokko van de Bult. Abstract: For any positive integer r, let pi_{2r}(x) denote the number of prime pairs (p, p+2r) with p not exceeding (large) x. According to the prime-pair conjecture of Hardy and Littlewood, pi_{2r}(x) should be asymptotic to 2C_{2r}li_2(x) with an explicit positive constant C_{2r}. A heuristic argument indicates that the remainder e_{2r}(x) in this approximation cannot be of lower order than x^beta, where beta is the supremum of the real parts of zeta's zeros. The argument also suggests an approximation for pi_{2r}(x) similar to one of Riemann for pi(x). LINKS Jacob Korevaar, Lower bound for the remainder in the prime-pair conjecture, arXiv:0806.4057 FORMULA a(n) = #{p < 10^n in A028870}. EXAMPLE a(1) = 4 because {2, 3, 5, 7} are the 4 primes p less than 10^1 such that p^2-2 are primes, namely {2, 7, 23, 47}. a(2) = 13 = #{2, 3, 5, 7, 13, 19, 29, 37, 43, 47, 61, 71, 89}. CROSSREFS Cf. A000040, A028870. Sequence in context: A307398 A129147 A151476 * A149465 A149466 A006604 Adjacent sequences:  A140451 A140452 A140453 * A140455 A140456 A140457 KEYWORD nonn AUTHOR Jonathan Vos Post, Jun 26 2008 EXTENSIONS a(9) from Donovan Johnson, Feb 17 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 29 23:30 EDT 2021. Contains 346346 sequences. (Running on oeis4.)