A324197 - cp's OEIS frontend

A324197 Lexicographically earliest sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = A324195(n) for all other numbers except f(2) = -1 and f(n) = -2 when n is an odd prime.

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

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

cp's OEIS Frontend

A324197 Lexicographically earliest sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = A324195(n) for all other numbers except f(2) = -1 and f(n) = -2 when n is an odd prime.

Table of values

List of values

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

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

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