cp's OEIS Frontend

A024822 a(n) = least m such that if r and s in {1/1, 1/4, 1/7,..., 1/(3n-2)} satisfy r < s, then r < k/m < s for some integer k.

%I A024822 #14 Mar 06 2014 22:30:46
%S A024822 2,5,9,22,31,53,81,97,134,177,201,253,311,342,409,482,561,603,691,785,
%T A024822 885,937,1046,1161,1282,1409,1475,1611,1753,1901,2055,2215,2297,2466,
%U A024822 2641,2822,3009,3202,3301,3503,3711,3925,4145,4371,4486,4721
%N A024822 a(n) = least m such that if r and s in {1/1, 1/4, 1/7,..., 1/(3n-2)} satisfy r < s, then r < k/m < s for some integer k.
%C A024822 For a guide to related sequences, see A001000. - _Clark Kimberling_, Aug 07 2012
%H A024822 Clark Kimberling, <a href="/A024822/b024822.txt">Table of n, a(n) for n = 2..200</a>
%t A024822 leastSeparator[seq_] := Module[{n = 1},
%t A024822 Table[While[Or @@ (Ceiling[n #1[[1]]] <
%t A024822 2 + Floor[n #1[[2]]] &) /@ (Sort[#1, Greater] &) /@
%t A024822 Partition[Take[seq, k], 2, 1], n++]; n, {k, 2, Length[seq]}]];
%t A024822 t = Flatten[Table[1/(3 h - 2), {h, 1, 60}]];
%t A024822 leastSeparator[t]
%Y A024822 Cf. A001000.
%K A024822 nonn
%O A024822 2,1
%A A024822 _Clark Kimberling_
%E A024822 Corrected by _Clark Kimberling_, Aug 07 2012