|
%I #10 Mar 06 2014 22:37:00
%S 19,53,103,169,251,349,463,593,739,901,1101,1299,1537,1769,2045,2311,
%T 2625,2925,3277,3611,4001,4369,4797,5199,5665,6101,6605,7075,7617,
%U 8121,8701,9301,9859,10497,11155,11765,12461,13177,13839,14593,15367,16081,16893,17725
%N 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+4)/m < s for some integer k.
%C For a guide to related sequences, see A001000. - _Clark Kimberling_, Aug 12 2012
%H Clark Kimberling, <a href="/A024848/b024848.txt">Table of n, a(n) for n = 2..100</a>
%t leastSeparatorS[seq_, s_] := Module[{n = 1},
%t Table[While[Or @@ (Ceiling[n #1[[1]]] <
%t s + 1 + Floor[n #1[[2]]] &) /@ (Sort[#1, Greater] &) /@
%t Partition[Take[seq, k], 2, 1], n++]; n, {k, 2, Length[seq]}]];
%t t = Map[leastSeparatorS[1/(2*Range[50]), #] &, Range[5]];
%t TableForm[t]
%t t[[5]] (* A024848 *)
%t (* _Peter J. C. Moses_, Aug 06 2012 *)
%Y Cf. A001000, A024847.
%K nonn
%O 2,1
%A _Clark Kimberling_
|
