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 A227684 #5 Jul 20 2013 14:06:29
%S A227684 0,1,4,3,5,9,2,13,9,7,12,5,13,8,11,14,17,29,53,3,34,25,19,16,13,23,33,
%T A227684 10,17,24,31,52,7,39,25,18,29,51,11,37,26,15,34,19,42,23,27,31,39,47,
%U A227684 59,83,135,4,161,97,69,53,45,41,33,29,54,25,46,21,59,38
%N A227684 Numerator of least splitting rational of log(n) and log(n+1).
%C A227684 Suppose that x < y. The least splitter of x and y is introduced at A227631 as the least positive integer d such that x <= c/d < y for some integer c; the number c/d is called the least splitting rational of x and y.
%H A227684 Clark Kimberling, <a href="/A227684/b227684.txt">Table of n, a(n) for n = 1..1000</a>
%e A227684 The splitting rationals of consecutive numbers log(1), log(2), ... are 0, 1, 4/3, 3/2, 5/3, 9/5, 2, 13/6, 9/4, 7/3, 12/5, 5/2, 13/5; the denominators form A227634, and the numerators, A227684. Chain:
%e A227684 log(1) <= 0 < log(2) < 1 < log(3) < 4/3 < log(4) < 3/2 < log(5) < 5/3 < ...
%t A227684 h[n_] := h[n] = HarmonicNumber[n]; r[x_, y_] := Module[{c, d}, d = NestWhile[#1 + 1 &, 1, ! (c = Ceiling[#1 x - 1]) < Ceiling[#1 y] - 1 &]; (c + 1)/d]; t = Table[r[Log[n], Log[n + 1]], {n, 1, 120}] (*fractions*)
%t A227684 Denominator[t] (* A227634 *)
%t A227684 Numerator[t] (* A227684 *)
%Y A227684 Cf. A227631, A227634.
%K A227684 nonn,frac,easy
%O A227684 1,3
%A A227684 _Clark Kimberling_, Jul 19 2013