login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A354841
Number of primes between n and n+log(n), exclusive.
3
0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 2, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 2, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 2, 2, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1
OFFSET
1,28
COMMENTS
Inspired by A275235.
MATHEMATICA
a[n_] := Count[Range[n + 1, n + Log[n]], _?PrimeQ]; Array[a, 100] (* Amiram Eldar, Jun 08 2022 *)
PROG
(PARI) a(n) = primepi(n+log(n)) - primepi(n); \\ Michel Marcus, Jun 25 2022
CROSSREFS
Cf. A275235 (similar, but with n+log(n)^2), A354842.
Sequence in context: A080080 A093662 A284256 * A339772 A250211 A243753
KEYWORD
nonn
AUTHOR
Bernard Schott, Jun 08 2022
STATUS
approved