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).

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).

Terms

    a(0) =2a(1) =7a(2) =10a(3) =10a(4) =15a(5) =23a(6) =37a(7) =59a(8) =95a(9) =153a(10) =247a(11) =399a(12) =645a(13) =1043a(14) =1687a(15) =2729a(16) =4415a(17) =7143a(18) =11557a(19) =18699a(20) =30255a(21) =48953a(22) =79207a(23) =128159a(24) =207365a(25) =335523a(26) =542887a(27) =878409a(28) =1421295a(29) =2299703

External references