|
%I #13 Mar 01 2014 09:57:18
%S 5,9,25,37,65,81,121,169,197,257,325,361,441,529,625,677,785,901,1025,
%T 1089,1225,1369,1521,1681,1765,1937,2117,2305,2501,2601,2809,3025,
%U 3249,3481,3721,3845,4097,4357,4625,4901,5185,5329,5625,5929,6241
%N a(n) = least m such that if r and s in {1/4, 1/8, 1/12,..., 1/4n} satisfy r < s, then r < k/m < s for some integer k.
%C For a guide to related sequences, see A001000. - _Clark Kimberling_, Aug 07 2012
%H Clark Kimberling, <a href="/A024825/b024825.txt">Table of n, a(n) for n = 2..300</a>
%t leastSeparator[seq_] := Module[{n = 1},
%t Table[While[Or @@ (Ceiling[n #1[[1]]] <
%t 2 + Floor[n #1[[2]]] &) /@ (Sort[#1, Greater] &) /@
%t Partition[Take[seq, k], 2, 1], n++]; n, {k, 2, Length[seq]}]];
%t t = Flatten[Table[1/(4 h), {h, 1, 60}]];
%t leastSeparator[t]
%t (* _Peter J. C. Moses_, Aug 01 2012 *)
%Y Cf. A001000.
%K nonn
%O 2,1
%A _Clark Kimberling_
%E Corrected and edited by _Clark Kimberling_, Aug 07 2012
|
