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.

A082892 Floor(q(j)), where q(j) = 2j/log(A000230(j)); log is natural logarithm, 2j-s are prime gaps > 1, A000230(j) is the minimal lesser prime opening the consecutive prime distance equals 2j.

Original entry on oeis.org

1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 4, 5, 5, 5, 5, 5, 5, 5, 6, 5, 6, 6, 6, 6, 6, 7, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 7, 8, 8, 8, 7, 8, 8, 8, 9, 8, 8, 9, 8, 8, 8, 9, 10, 9, 9, 10, 9, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 9, 10, 10, 10, 10, 10, 11
Offset: 1

Views

Author

Labos Elemer, Apr 17 2003

Keywords

Comments

For these larger and larger gap-initiating primes, integer part of relevant quotient,q, may exceed 27, all values between 1 and 28 occur. Observation supports conjecture that infsup(q) is infinity.

Crossrefs

Programs

  • Mathematica
    t=A000230 list; Table[Floor[2*j/Log[Part[t,j]]//N],{j,1,Length[t]}]