cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A365573 Number of primes between prime(n) and prime(n)+log(prime(n)), exclusive.

Original entry on oeis.org

0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 2, 2, 1, 0, 0, 1, 0, 1
Offset: 1

Views

Author

Alain Rocchelli, Sep 09 2023

Keywords

Comments

Inspired by A354841.

Crossrefs

Programs

  • PARI
    a(n) = primepi(prime(n)+log(prime(n))) - primepi(prime(n))

Formula

Conjecture: Limit_{N->oo} (Ratio_{n=1..N} a(n)=0) = 1/e (A068985).