|
|
A364459
|
|
Number of primes in the interval [n,n+log(n)^2].
|
|
1
|
|
|
0, 1, 1, 1, 2, 1, 1, 1, 2, 2, 2, 2, 3, 2, 2, 3, 3, 2, 2, 1, 2, 3, 3, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 3, 3, 4, 4, 3, 3, 2, 3, 3, 4, 3, 3, 3, 3, 4, 4, 3, 4, 4, 5, 5, 5, 4, 4, 4, 4, 4, 4, 5, 5, 4, 4, 4, 5, 4, 4, 3, 3, 3, 3, 3, 4, 3, 3, 4, 4, 4, 4, 4, 4, 5, 6, 5, 5, 5, 6, 6, 6, 6, 6, 5, 5, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
On average, there are log(n) primes in the interval [n,n+log(n)^2] for any number n.
|
|
LINKS
|
|
|
MAPLE
|
a:= n-> add(`if`(isprime(i), 1, 0), i=n..floor(n+log(n)^2)):
|
|
PROG
|
(PARI) for(n=2, 100, An=primepi(n+(log(n))^2)-primepi(n-1); print1(An, ", "))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|