A326203 - cp's OEIS frontend

A326203 Lexicographically earliest sequence such that for all i, j, a(i) = a(j) => f(i) = f(j), where f(n) = 0 if n > 2 and gcd(n,phi(n)) = 1, with f(n) = n for all other numbers.

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	9
13	3
14	10
15	3
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	22
33	3
34	23
35	3
36	24
37	3
38	25
39	26
40	27
41	3
42	28
43	3
44	29
45	30
46	31
47	3
48	32
49	33
50	34
51	3
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	44
65	3
66	45
67	3
68	46
69	3
70	47
71	3
72	48
73	3
74	49
75	50
76	51
77	3
78	52
79	3
80	53
81	54
82	55
83	3
84	56
85	3
86	57
87	3
88	58
89	3
90	59
91	3
92	60
93	61
94	62
95	3
96	63
97	3
98	64
99	65
100	66
101	3
102	67
103	3

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

cp's OEIS Frontend

A326203 Lexicographically earliest sequence such that for all i, j, a(i) = a(j) => f(i) = f(j), where f(n) = 0 if n > 2 and gcd(n,phi(n)) = 1, with f(n) = n for all other numbers.

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	9
13	3
14	10
15	3
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	22
33	3
34	23
35	3
36	24
37	3
38	25
39	26
40	27
41	3
42	28
43	3
44	29
45	30
46	31
47	3
48	32
49	33
50	34
51	3
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	44
65	3
66	45
67	3
68	46
69	3
70	47
71	3
72	48
73	3
74	49
75	50
76	51
77	3
78	52
79	3
80	53
81	54
82	55
83	3
84	56
85	3
86	57
87	3
88	58
89	3
90	59
91	3
92	60
93	61
94	62
95	3
96	63
97	3
98	64
99	65
100	66
101	3
102	67
103	3

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	9
13	3
14	10
15	3
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	22
33	3
34	23
35	3
36	24
37	3
38	25
39	26
40	27
41	3
42	28
43	3
44	29
45	30
46	31
47	3
48	32
49	33
50	34
51	3
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	44
65	3
66	45
67	3
68	46
69	3
70	47
71	3
72	48
73	3
74	49
75	50
76	51
77	3
78	52
79	3
80	53
81	54
82	55
83	3
84	56
85	3
86	57
87	3
88	58
89	3
90	59
91	3
92	60
93	61
94	62
95	3
96	63
97	3
98	64
99	65
100	66
101	3
102	67
103	3

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	9
13	3
14	10
15	3
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	22
33	3
34	23
35	3
36	24
37	3
38	25
39	26
40	27
41	3
42	28
43	3
44	29
45	30
46	31
47	3
48	32
49	33
50	34
51	3
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	44
65	3
66	45
67	3
68	46
69	3
70	47
71	3
72	48
73	3
74	49
75	50
76	51
77	3
78	52
79	3
80	53
81	54
82	55
83	3
84	56
85	3
86	57
87	3
88	58
89	3
90	59
91	3
92	60
93	61
94	62
95	3
96	63
97	3
98	64
99	65
100	66
101	3
102	67
103	3