A326201 - cp's OEIS frontend

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

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

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

cp's OEIS Frontend

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

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

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