A024831 - cp's OEIS frontend

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

n	a(n)
2	2
3	7
4	10
5	10
6	15
7	23
8	37
9	59
10	95
11	153
12	247
13	399
14	645
15	1043
16	1687
17	2729
18	4415
19	7143
20	11557
21	18699
22	30255
23	48953
24	79207
25	128159
26	207365
27	335523
28	542887
29	878409
30	1421295
31	2299703
32	3720997
33	6020699
34	9741695
35	15762393
36	25504087
37	41266479
38	66770565
39	108037043
40	174807607
41	282844649

[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]

cp's OEIS Frontend

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

Table of values

List of values