|
|
A223853
|
|
a(n) = ceiling(li(2*2^n) - li(2^n)) - (pi(2*2^n) - pi(2^n)) with li(x) the logarithmic integral and pi(x) the prime counting function.
|
|
3
|
|
|
1, 1, 2, 1, 2, 2, 2, 1, 3, 4, 1, 7, 1, 13, 10, 4, 25, -5, 49, 17, 38, 82, 103, -55, 245, 290, 105, 621, -107, 1219, 1196, -274, 1749, 5329, 2881, 2451, 6836, 2910, 15905, 28044, -10652, 55758, 18068, 129994, -95925, 52787, 443983, 253331, 151395, 740898, -352415
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
This is the difference between the estimate for the number of primes in power of two intervals determined by the li approximation, and the actual number of primes in the power of two interval. The MAGMA program gives the ceiling of the difference between the li estimate at the end points of the interval and the actual number of primes in the interval (A036378).
H. J. J. te Riele (1987) using methods developed by Lehman (1966) showed that between 6.62*10^370 and 6.69*10^370 there are more than 10^180 consecutive integers where pi(x) > li(x). It is worth noting that this falls entirely within the power of two interval starting at 2^1231, and while the condition "li underestimates the number of primes in an interval" is not sufficient to imply that pi(x) > li(x), for example in (2^18, 2^19) li(x) underestimates by 5 but li(x) > pi(x) at every point in the interval, it does seem to be necessary for this to occur, assuming runs of consecutive values where pi(x) > li(x) do not cross a power of two.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
pi = Table[PrimePi[2^n], {n, 1, 30}];
li = Table[LogIntegral[2^n], {n, 1, 30}];
Ceiling[Rest@li - Most@li] - (Rest@pi - Most@pi) (* Peter Luschny, Oct 14 2017 *)
|
|
PROG
|
(Magma)
1;
for i := 2 to 29 do
x := 2^i;
y := 2^(i+1);
delta_li := Ceiling(LogIntegral(y) - LogIntegral(x));
delta_pi := #PrimesInInterval(x, y);
delta_li - delta_pi;
end for;
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|