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.
%I A082892 #14 Oct 15 2013 22:31:57
%S A082892 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,
%T A082892 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,
%U A082892 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
%N 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.
%C A082892 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.
%t A082892 t=A000230 list; Table[Floor[2*j/Log[Part[t,j]]//N],{j,1,Length[t]}]
%Y A082892 Cf. A000230, A082862, A082884-A082891, A002386.
%K A082892 nonn
%O A082892 1,2
%A A082892 _Labos Elemer_, Apr 17 2003