|
|
A275235
|
|
Number of primes between n and n+log(n)^2.
|
|
4
|
|
|
0, 0, 0, 1, 1, 1, 0, 1, 2, 2, 1, 2, 2, 2, 2, 3, 2, 2, 1, 1, 2, 3, 2, 2, 2, 2, 3, 3, 2, 3, 2, 3, 3, 3, 4, 4, 3, 3, 3, 4, 3, 3, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 4, 4, 5, 5, 4, 4, 3, 4, 4, 4, 4, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 4, 4, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,9
|
|
COMMENTS
|
According to Schinzel's formulation of Cramer's conjecture, a(n) > 0 for n > 7; see Guy.
|
|
REFERENCES
|
R. K. Guy, Unsolved Problems in Number Theory, 3rd ed., Springer, 2004, page 11.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
Table[PrimePi[n + Log[n]^2] - PrimePi[n], {n, 1, 200}]
|
|
PROG
|
(PARI) a(n) = primepi(n+log(n)^2) - primepi(n) \\ Felix Fröhlich, Jul 21 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|