login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214921 Least m > 0 such that for every r and s in the set S = {{h*sqrt(2)} : h = 1,..,n} of fractional parts, if r < s, then r < k/m < s for some integer k. 2

%I #13 Dec 25 2023 18:07:15

%S 2,3,4,5,7,7,12,12,12,12,12,15,15,17,17,17,23,29,29,29,29,29,29,29,29,

%T 29,29,29,33,36,36,36,41,41,41,41,41,41,41,41,70,70,70,70,70,70,70,70,

%U 70,70,70,70,70,70,70,70,70,70,70,70,70,70,70,70,70,70,70,70

%N Least m > 0 such that for every r and s in the set S = {{h*sqrt(2)} : h = 1,..,n} of fractional parts, if r < s, then r < k/m < s for some integer k.

%C a(n) is the least separator of S, as defined at A001000, which includes a guide to related sequences. - _Clark Kimberling_, Aug 12 2012

%H Clark Kimberling, <a href="/A214921/b214921.txt">Table of n, a(n) for n = 2..300</a>

%e Write the fractional parts of h*sqrt(2) for h=1,2,...,6, sorted, as f1, f2, f3, f4, f5, f6. Then f1 < 1/7 < f2 < 2/7 < f3 < 3/7 < f4 < 4/7 < f5 < 5/7 < f6, and 7 is the least m for which such a separation by fractions k/m occurs, so that a(6)=7.

%t leastSeparatorShort[seq_, s_] := Module[{n = 1},

%t While[Or @@ (n #1[[1]] <= s + Floor[n #1[[2]]] &) /@ (Sort[#1, Greater] &) /@

%t Partition[seq, 2, 1], n++]; n];

%t Table[leastSeparatorShort[Sort[N[FractionalPart[Sqrt[2] Range[n]], 50]], 1], {n, 2, 100}]

%t (* _Peter J. C. Moses_, Aug 01 2012 *)

%Y Cf. A001000, A214964, A214965.

%K nonn

%O 2,1

%A _Clark Kimberling_, Aug 12 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 02:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)