The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 1
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 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. LINKS MATHEMATICA t=A000230 list; Table[Floor[2*j/Log[Part[t, j]]//N], {j, 1, Length[t]}] CROSSREFS Cf. A000230, A082862, A082884-A082891, A002386. Sequence in context: A008350 A019556 A165640 * A025839 A053261 A123584 Adjacent sequences: A082889 A082890 A082891 * A082893 A082894 A082895 KEYWORD nonn AUTHOR Labos Elemer, Apr 17 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 1 05:02 EST 2022. Contains 358454 sequences. (Running on oeis4.)