A381658 - cp's OEIS frontend

A381658 Lexicographically earliest sequence of positive integers such that for each distinct positive integer t there is only one value of k such that t = a(n) = a(n+k) = a(n+2*k).

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

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

cp's OEIS Frontend

A381658 Lexicographically earliest sequence of positive integers such that for each distinct positive integer t there is only one value of k such that t = a(n) = a(n+k) = a(n+2*k).

Table of values

List of values

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

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

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