login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A152051 Hardy-Littlewood approximation to the number of twin primes less than 10^n. 1
5, 14, 46, 214, 1249, 8248, 58754, 440368, 3425308, 27411417, 224368865, 1870559867, 15834598305, 135780264894, 1177208491861, 10304192554496, 90948833260990, 808675901493606, 7237518062753712, 65154265428712141 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Another good approximation to the number of twin primes < 10^n is the sum of twin primes < 10^(n/2)/4. For example Pi2(10^16) = 10304185697298.

SumPi2(10^8)/4 = 10301443659233 for an error of 0.0000266. However, the Hardy-Littlewood approximation is superior giving an error of -0.000000665.

LINKS

Table of n, a(n) for n=1..20.

FORMULA

C_2 = 0.660161815846869573927812110014555778432623. Li_2(x) = 2*C_2*integral(t=2..x,dt/log(t)^2)

PROG

(PARI) Li_2(x) = intnum(t=2, x, 2*0.660161815846869573927812110014555778432623/log(t)^2)

CROSSREFS

Sequence in context: A244236 A163608 A081496 * A220563 A075827 A134418

Adjacent sequences:  A152048 A152049 A152050 * A152052 A152053 A152054

KEYWORD

nonn

AUTHOR

Cino Hilliard, Nov 22 2008

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 25 03:53 EDT 2021. Contains 346283 sequences. (Running on oeis4.)