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 A024829 #18 Jul 25 2019 01:00:53
%S A024829 4,11,29,173,1063,7074,47753,325961,2228269,15262701,104577551,
%T A024829 716721983,4912208209
%N A024829 a(n) = least m such that if r and s in {F(2*h-1)/F(2*h): h = 1,2,...,n} satisfy r < s, then r < k/m < s for some integer k, where F = A000045 (Fibonacci numbers).
%C A024829 For a guide to related sequences, see A001000. - _Clark Kimberling_, Aug 07 2012
%t A024829 leastSeparator[seq_] := Module[{n = 1},
%t A024829 Table[While[Or @@ (Ceiling[n #1[[1]]] <
%t A024829 2 + Floor[n #1[[2]]] &) /@ (Sort[#1, Greater] &) /@
%t A024829 Partition[Take[seq, k], 2, 1], n++]; n, {k, 2, Length[seq]}]];
%t A024829 t = Table[N[Fibonacci[2 h - 1]/Fibonacci[2 h]], {h, 1, 10}]
%t A024829 t1 = leastSeparator[t]
%t A024829 (* _Peter J. C. Moses_, Aug 01 2012 *)
%Y A024829 Cf. A001000, A024830.
%K A024829 nonn,more
%O A024829 2,1
%A A024829 _Clark Kimberling_
%E A024829 Corrected by _Clark Kimberling_, Aug 07 2012
%E A024829 a(11)-a(14) from _Sean A. Irvine_, Jul 25 2019