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 A024835 #14 Jun 27 2022 18:52:05
%S A024835 7,17,31,49,81,111,157,197,257,307,381,441,529,625,703,813,931,1025,
%T A024835 1157,1297,1407,1561,1723,1849,2025,2209,2401,2551,2757,2971,3193,
%U A024835 3365,3601,3845,4097,4291,4557,4831,5113,5329,5625,5929,6241,6561,6807,7141,7483,7833
%N A024835 a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.
%C A024835 For a guide to related sequences, see A001000. - _Clark Kimberling_, Aug 12 2012
%H A024835 Clark Kimberling, <a href="/A024835/b024835.txt">Table of n, a(n) for n = 2..100</a>
%t A024835 leastSeparatorS[seq_, s_] := Module[{n = 1},
%t A024835 Table[While[Or @@ (Ceiling[n #1[[1]]] <
%t A024835 s + 1 + Floor[n #1[[2]]] &) /@ (Sort[#1, Greater] &) /@
%t A024835 Partition[Take[seq, k], 2, 1], n++]; n, {k, 2, Length[seq]}]];
%t A024835 t = Map[leastSeparatorS[1/(2*Range[50]), #] &, Range[5]];
%t A024835 t[[2]] (* A024835 *)
%t A024835 (* _Peter J. C. Moses_, Aug 06 2012 *)
%Y A024835 Cf. A001000, A024834.
%K A024835 nonn
%O A024835 2,1
%A A024835 _Clark Kimberling_