A024819 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 < s for some integer k.
2, 4, 11, 16, 29, 37, 56, 67, 92, 121, 137, 172, 211, 254, 277, 326, 379, 436, 466, 529, 596, 667, 704, 781, 862, 947, 1036, 1082, 1177, 1276, 1379, 1486, 1597, 1654, 1771, 1892, 2017, 2146, 2279, 2347, 2486, 2629, 2776, 2927, 3082, 3161, 3322, 3487, 3656, 3829, 4006, 4187
Offset: 2
Keywords
Links
- Clark Kimberling, Table of n, a(n) for n = 2..300
Crossrefs
Cf. A001000.
Programs
-
Mathematica
leastSeparator[seq_] := Module[{n = 1}, Table[While[Or @@ (Ceiling[n #1[[1]]] < 2 + Floor[n #1[[2]]] &) /@ Partition[Take[seq, k], 2, 1], n++]; n, {k, 2, Length[seq]}]]; t = Table[1/(2 h - 1), {h, 1, 101}]; leastSeparator[t] (* Peter J. C. Moses, Aug 01 2012 *)
Comments