A367849 - cp's OEIS frontend

A367849 Lexicographically earliest infinite sequence of positive integers such that for each n, the values in a path of locations starting from any i=n are all distinct, where jumps are allowed from location i to i+a(i).

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

[1, 1, 2, 1, 3, 1, 1, 4, 1, 1, 2, 5, 3, 1, 1, 4, 6, 1, 1, 5, 1, 1, 7, 1, 6, 1, 1, 2, 1, 8, 7, 1, 1, 2, 1, 3, 1, 9, 4, 1, 1, 2, 5, 3, 1, 1, 10, 6, 1, 1, 2, 1, 3, 7, 1, 4, 11, 1, 1, 5, 8, 1, 1, 2, 6, 3, 1, 12, 9, 1, 7, 1, 1, 2, 1, 3, 1, 10, 4, 13, 1, 1, 5, 1, 1, 2, 1, 11, 1, 1, 2, 1, 14, 1, 1, 2, 1, 3]

cp's OEIS Frontend

A367849 Lexicographically earliest infinite sequence of positive integers such that for each n, the values in a path of locations starting from any i=n are all distinct, where jumps are allowed from location i to i+a(i).

Table of values

List of values

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

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

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