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!)
A024831 a(n) = least m such that if r and s in {F(h)/F(2*h): h = 1,2,...,n} satisfy r < s, then r < k/m < s for some integer k, where F = A000045 (Fibonacci numbers). 1
2, 7, 10, 10, 15, 23, 37, 59, 95, 153, 247, 399, 645, 1043, 1687, 2729, 4415, 7143, 11557, 18699, 30255, 48953, 79207, 128159, 207365, 335523, 542887, 878409, 1421295, 2299703, 3720997, 6020699, 9741695, 15762393, 25504087, 41266479, 66770565, 108037043, 174807607, 282844649 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

COMMENTS

For a guide to related sequences, see A001000. - Clark Kimberling, Aug 07 2012

LINKS

Table of n, a(n) for n=2..41.

W. Kuszmaul, Fast Algorithms for Finding Pattern Avoiders and Counting Pattern Occurrences in Permutations, arXiv preprint arXiv:1509.08216, 2015

MATHEMATICA

leastSeparator[seq_] := Module[{n = 1},

Table[While[Or @@ (Ceiling[n #1[[1]]] <

2 + Floor[n #1[[2]]] &) /@ (Sort[#1, Greater] &) /@

Partition[Take[seq, k], 2, 1], n++]; n, {k, 2, Length[seq]}]];

t = Table[N[Fibonacci[h]/Fibonacci[2 h]], {h, 1, 30}]

t1 = leastSeparator[t]

(* Peter J. C. Moses, Aug 01 2012 *)

CROSSREFS

Cf. A001000.

Sequence in context: A022414 A319932 A236243 * A194421 A043357 A023730

Adjacent sequences:  A024828 A024829 A024830 * A024832 A024833 A024834

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

All the terms were corrected by Clark Kimberling, Aug 07 2012

More terms from Sean A. Irvine, Jul 25 2019

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 21 10:05 EST 2022. Contains 350476 sequences. (Running on oeis4.)