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 A024837 #12 Jun 27 2022 18:53:16
%S A024837 7,21,41,67,100,155,205,281,346,443,523,641,737,876,1027,1149,1321,
%T A024837 1505,1651,1856,2073,2243,2481,2731,2993,3197,3480,3775,4082,4321,
%U A024837 4649,4989,5341,5613,5986,6371,6768,7073,7491,7921,8363,8702,9165,9640,10127,10626,11009
%N A024837 a(n) = least m such that if r and s in {1/2, 1/5, 1/8, ..., 1/(3n-1)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.
%C A024837 For a guide to related sequences, see A001000. - _Clark Kimberling_, Aug 12 2012
%H A024837 Clark Kimberling, <a href="/A024837/b024837.txt">Table of n, a(n) for n = 2..100</a>
%t A024837 leastSeparatorS[seq_, s_] := Module[{n = 1},
%t A024837 Table[While[Or @@ (Ceiling[n #1[[1]]] <
%t A024837 s + 1 + Floor[n #1[[2]]] &) /@ (Sort[#1, Greater] &) /@
%t A024837 Partition[Take[seq, k], 2, 1], n++]; n, {k, 2, Length[seq]}]];
%t A024837 t = Map[leastSeparatorS[1/(3*Range[50]-1), #] &, Range[5]];
%t A024837 t[[2]] (* A024837 *)
%t A024837 (* _Peter J. C. Moses_, Aug 06 2012 *)
%Y A024837 Cf. A001000, A024836, A024838.
%K A024837 nonn
%O A024837 2,1
%A A024837 _Clark Kimberling_