A331301 - cp's OEIS frontend

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

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

cp's OEIS Frontend

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

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

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