A064034 - cp's OEIS frontend

A064034 2-dimensional table T(i, j) defined for any integers i and j, read by antidiagonals in the southeast quadrant. T(i, j) gives the "Fibonacci depth" of (i, j): form the Fibonacci sequence starting with i, j: w(0) = i, w(1) = j, w(n) = w(n-1) + w(n-2). It can be shown that for all but finitely many n, the w(n) have the same sign, i.e., are all positive, all negative or all zero. T(i, j), is the smallest number of iterations required to find out which of these cases holds.

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

[0, 1, 2, 1, 3, 2, 1, 1, 4, 2, 1, 1, 3, 2, 2, 1, 1, 1, 5, 2, 2, 1, 1, 1, 3, 4, 2, 2, 1, 1, 1, 1, 3, 2, 2, 2, 1, 1, 1, 1, 3, 6, 2, 2, 2, 1, 1, 1, 1, 1, 3, 4, 2, 2, 2, 1, 1, 1, 1, 1, 3, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 3, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 3, 3, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 3, 7, 2, 2, 2, 2, 2]

cp's OEIS Frontend

Table of values

List of values

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

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

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