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 A024847 #12 Jun 27 2022 18:51:13
%S A024847 8,34,76,134,208,298,404,526,664,818,1009,1198,1427,1651,1918,2176,
%T A024847 2481,2773,3116,3442,3823,4183,4602,4996,5453,5881,6376,6838,7371,
%U A024847 7867,8438,8969,9578,10207,10791,11458,12145,12781,13506,14251,14939,15722,16525,17265
%N A024847 a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.
%C A024847 For a guide to related sequences, see A001000. - _Clark Kimberling_, Aug 12 2012
%H A024847 Clark Kimberling, <a href="/A024847/b024847.txt">Table of n, a(n) for n = 2..100</a>
%t A024847 leastSeparatorS[seq_, s_] := Module[{n = 1},
%t A024847 Table[While[Or @@ (Ceiling[n #1[[1]]] <
%t A024847 s + 1 + Floor[n #1[[2]]] &) /@ (Sort[#1, Greater] &) /@
%t A024847 Partition[Take[seq, k], 2, 1], n++]; n, {k, 2, Length[seq]}]];
%t A024847 t = Map[leastSeparatorS[1/(2*Range[50]-1), #] &, Range[5]];
%t A024847 t[[5]] (* A024847 *)
%t A024847 (* _Peter J. C. Moses_, Aug 06 2012 *)
%Y A024847 Cf. A001000, A024848.
%K A024847 nonn
%O A024847 2,1
%A A024847 _Clark Kimberling_