A360593 - cp's OEIS frontend

A360593 Each term a(i) can reach a(i+a(i)) and a(i-a(i)) if these terms exist. a(n) is the greatest number of terms among a(1..n-1) that can be reached by starting at a(n-1) and visiting no term more than once; a(0)=0. See example.

n	a(n)
0	0
1	1
2	2
3	2
4	4
5	2
6	6
7	2
8	7
9	5
10	6
11	6
12	9
13	10
14	10
15	6
16	8
17	7
18	9
19	8
20	11
21	8
22	12
23	14
24	12
25	14
26	19
27	16
28	19
29	14
30	14
31	16
32	14
33	21
34	14
35	16
36	21
37	14
38	14
39	16
40	14
41	18
42	14
43	16
44	21
45	21
46	19
47	21
48	22
49	22
50	21
51	23
52	24
53	24
54	29
55	29
56	22
57	26
58	24
59	28
60	24
61	26
62	31
63	24
64	31
65	34
66	24
67	30
68	34
69	29
70	39

[0, 1, 2, 2, 4, 2, 6, 2, 7, 5, 6, 6, 9, 10, 10, 6, 8, 7, 9, 8, 11, 8, 12, 14, 12, 14, 19, 16, 19, 14, 14, 16, 14, 21, 14, 16, 21, 14, 14, 16, 14, 18, 14, 16, 21, 21, 19, 21, 22, 22, 21, 23, 24, 24, 29, 29, 22, 26, 24, 28, 24, 26, 31, 24, 31, 34, 24, 30, 34, 29, 39]

cp's OEIS Frontend

A360593 Each term a(i) can reach a(i+a(i)) and a(i-a(i)) if these terms exist. a(n) is the greatest number of terms among a(1..n-1) that can be reached by starting at a(n-1) and visiting no term more than once; a(0)=0. See example.

Table of values

List of values

n	a(n)
0	0
1	1
2	2
3	2
4	4
5	2
6	6
7	2
8	7
9	5
10	6
11	6
12	9
13	10
14	10
15	6
16	8
17	7
18	9
19	8
20	11
21	8
22	12
23	14
24	12
25	14
26	19
27	16
28	19
29	14
30	14
31	16
32	14
33	21
34	14
35	16
36	21
37	14
38	14
39	16
40	14
41	18
42	14
43	16
44	21
45	21
46	19
47	21
48	22
49	22
50	21
51	23
52	24
53	24
54	29
55	29
56	22
57	26
58	24
59	28
60	24
61	26
62	31
63	24
64	31
65	34
66	24
67	30
68	34
69	29
70	39

n	a(n)
0	0
1	1
2	2
3	2
4	4
5	2
6	6
7	2
8	7
9	5
10	6
11	6
12	9
13	10
14	10
15	6
16	8
17	7
18	9
19	8
20	11
21	8
22	12
23	14
24	12
25	14
26	19
27	16
28	19
29	14
30	14
31	16
32	14
33	21
34	14
35	16
36	21
37	14
38	14
39	16
40	14
41	18
42	14
43	16
44	21
45	21
46	19
47	21
48	22
49	22
50	21
51	23
52	24
53	24
54	29
55	29
56	22
57	26
58	24
59	28
60	24
61	26
62	31
63	24
64	31
65	34
66	24
67	30
68	34
69	29
70	39

n	a(n)
0	0
1	1
2	2
3	2
4	4
5	2
6	6
7	2
8	7
9	5
10	6
11	6
12	9
13	10
14	10
15	6
16	8
17	7
18	9
19	8
20	11
21	8
22	12
23	14
24	12
25	14
26	19
27	16
28	19
29	14
30	14
31	16
32	14
33	21
34	14
35	16
36	21
37	14
38	14
39	16
40	14
41	18
42	14
43	16
44	21
45	21
46	19
47	21
48	22
49	22
50	21
51	23
52	24
53	24
54	29
55	29
56	22
57	26
58	24
59	28
60	24
61	26
62	31
63	24
64	31
65	34
66	24
67	30
68	34
69	29
70	39