A323367 - cp's OEIS frontend

A323367 Lexicographically earliest such sequence a that for all i, j, a(i) = a(j) => f(i) = f(j), where f(n) = 0 for odd primes, and f(n) = A323366(n) for any other number.

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

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

cp's OEIS Frontend

A323367 Lexicographically earliest such sequence a that for all i, j, a(i) = a(j) => f(i) = f(j), where f(n) = 0 for odd primes, and f(n) = A323366(n) for any other number.

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

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

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