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.

A366134 Number of primes between prime(n) and prime(n)+2*log(prime(n)), exclusive.

Original entry on oeis.org

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

Views

Author

Alain Rocchelli, Sep 30 2023

Keywords

Comments

Inspired by A365573.

Crossrefs

Programs

  • Mathematica
    a[n_]:=PrimePi[Prime[n]+2Log[Prime[n]]]-PrimePi[Prime[n]]; Array[a,95] (* Stefano Spezia, Sep 30 2023 *)
  • PARI
    a(n) = primepi(prime(n)+2*log(prime(n))) - primepi(prime(n))

Formula

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