A088858 - cp's OEIS frontend

A088858 Define a Fibonacci-type sequence to be one of the form s(0) = s_1 >= 1, s(1) = s_2 >= 1, s(n+2) = s(n+1) + s(n); then a(n) = maximal m such that n is the m-th term in some Fibonacci-type sequence.

n	a(n)
1	1
2	2
3	3
4	3
5	4
6	3
7	4
8	5
9	4
10	4
11	5
12	4
13	6
14	5
15	4
16	5
17	5
18	6
19	5
20	5
21	7
22	5
23	6
24	5
25	5
26	6
27	5
28	6
29	7
30	5
31	6
32	5
33	6
34	8
35	5
36	6
37	7
38	6
39	6
40	5
41	6
42	7
43	6
44	6
45	7
46	6
47	8
48	6
49	6
50	7
51	6
52	6
53	7
54	6
55	9
56	6
57	6
58	7
59	6
60	8
61	7
62	6
63	7
64	6
65	6
66	7
67	6
68	8
69	7
70	6
71	7
72	6
73	8
74	7
75	6
76	9
77	7
78	6
79	7
80	6
81	8
82	7
83	6
84	7
85	7
86	8
87	7
88	6
89	10
90	7

[1, 2, 3, 3, 4, 3, 4, 5, 4, 4, 5, 4, 6, 5, 4, 5, 5, 6, 5, 5, 7, 5, 6, 5, 5, 6, 5, 6, 7, 5, 6, 5, 6, 8, 5, 6, 7, 6, 6, 5, 6, 7, 6, 6, 7, 6, 8, 6, 6, 7, 6, 6, 7, 6, 9, 6, 6, 7, 6, 8, 7, 6, 7, 6, 6, 7, 6, 8, 7, 6, 7, 6, 8, 7, 6, 9, 7, 6, 7, 6, 8, 7, 6, 7, 7, 8, 7, 6, 10, 7]

cp's OEIS Frontend

A088858 Define a Fibonacci-type sequence to be one of the form s(0) = s_1 >= 1, s(1) = s_2 >= 1, s(n+2) = s(n+1) + s(n); then a(n) = maximal m such that n is the m-th term in some Fibonacci-type sequence.

Table of values

List of values

n	a(n)
1	1
2	2
3	3
4	3
5	4
6	3
7	4
8	5
9	4
10	4
11	5
12	4
13	6
14	5
15	4
16	5
17	5
18	6
19	5
20	5
21	7
22	5
23	6
24	5
25	5
26	6
27	5
28	6
29	7
30	5
31	6
32	5
33	6
34	8
35	5
36	6
37	7
38	6
39	6
40	5
41	6
42	7
43	6
44	6
45	7
46	6
47	8
48	6
49	6
50	7
51	6
52	6
53	7
54	6
55	9
56	6
57	6
58	7
59	6
60	8
61	7
62	6
63	7
64	6
65	6
66	7
67	6
68	8
69	7
70	6
71	7
72	6
73	8
74	7
75	6
76	9
77	7
78	6
79	7
80	6
81	8
82	7
83	6
84	7
85	7
86	8
87	7
88	6
89	10
90	7

n	a(n)
1	1
2	2
3	3
4	3
5	4
6	3
7	4
8	5
9	4
10	4
11	5
12	4
13	6
14	5
15	4
16	5
17	5
18	6
19	5
20	5
21	7
22	5
23	6
24	5
25	5
26	6
27	5
28	6
29	7
30	5
31	6
32	5
33	6
34	8
35	5
36	6
37	7
38	6
39	6
40	5
41	6
42	7
43	6
44	6
45	7
46	6
47	8
48	6
49	6
50	7
51	6
52	6
53	7
54	6
55	9
56	6
57	6
58	7
59	6
60	8
61	7
62	6
63	7
64	6
65	6
66	7
67	6
68	8
69	7
70	6
71	7
72	6
73	8
74	7
75	6
76	9
77	7
78	6
79	7
80	6
81	8
82	7
83	6
84	7
85	7
86	8
87	7
88	6
89	10
90	7

n	a(n)
1	1
2	2
3	3
4	3
5	4
6	3
7	4
8	5
9	4
10	4
11	5
12	4
13	6
14	5
15	4
16	5
17	5
18	6
19	5
20	5
21	7
22	5
23	6
24	5
25	5
26	6
27	5
28	6
29	7
30	5
31	6
32	5
33	6
34	8
35	5
36	6
37	7
38	6
39	6
40	5
41	6
42	7
43	6
44	6
45	7
46	6
47	8
48	6
49	6
50	7
51	6
52	6
53	7
54	6
55	9
56	6
57	6
58	7
59	6
60	8
61	7
62	6
63	7
64	6
65	6
66	7
67	6
68	8
69	7
70	6
71	7
72	6
73	8
74	7
75	6
76	9
77	7
78	6
79	7
80	6
81	8
82	7
83	6
84	7
85	7
86	8
87	7
88	6
89	10
90	7