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!)
A024849 a(n) = least m such that if r and s in {|F(h+1)-tau*F(h)|: h = 1,2,...,n} satisfy r < s, then r < k/m < s for some integer k, where F = A000045 (Fibonacci numbers) and tau = (1+sqrt(5))/2 (golden ratio). 1

%I #18 Apr 17 2014 03:32:54

%S 2,4,6,9,14,23,36,59,94,153,246,399,644,1043,1686,2729,4414,7143,

%T 11556,18699

%N a(n) = least m such that if r and s in {|F(h+1)-tau*F(h)|: h = 1,2,...,n} satisfy r < s, then r < k/m < s for some integer k, where F = A000045 (Fibonacci numbers) and tau = (1+sqrt(5))/2 (golden ratio).

%C For a guide to related sequences, see A001000. - _Clark Kimberling_, Aug 12 2012

%t f[n_] := Fibonacci[n]; r = GoldenRatio;

%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[Abs[f[h + 1] - r*f[h]], {h, 1, 21}]];

%t leastSeparator[t]

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

%Y Cf. A000045, A001000, A001622.

%K nonn,more

%O 2,1

%A _Clark Kimberling_

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 August 14 01:54 EDT 2024. Contains 375146 sequences. (Running on oeis4.)