A331174 - cp's OEIS frontend

A331174 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = min(n, A122111(n)), for all other n, except for odd primes p, f(p) = 0.

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

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

cp's OEIS Frontend

A331174 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = min(n, A122111(n)), for all other n, except for odd primes p, f(p) = 0.

Table of values

List of values

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

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

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