A322973 - cp's OEIS frontend

A322973 Lexicographically earliest such sequence a that a(i) = a(j) => f(i) = f(j) for all i, j, where f(1) = 0, f(n) = -1 if n is an odd prime, and f(n) = A006370(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	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	29
40	30
41	3
42	31
43	3
44	32
45	33
46	34
47	3
48	35
49	36
50	37
51	38
52	39
53	3
54	40
55	41
56	7
57	42
58	43
59	3
60	44
61	3
62	45
63	46
64	47
65	48
66	49
67	3
68	50
69	51
70	52
71	3
72	53
73	3
74	54
75	55
76	56
77	57
78	58
79	3
80	59
81	60
82	61
83	3
84	62
85	63
86	64
87	65
88	66
89	3
90	67
91	68
92	11
93	69
94	70
95	71
96	72
97	3
98	73
99	74
100	75
101	3
102	76
103	3

[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, 29, 30, 3, 31, 3, 32, 33, 34, 3, 35, 36, 37, 38, 39, 3, 40, 41, 7, 42, 43, 3, 44, 3, 45, 46, 47, 48, 49, 3, 50, 51, 52, 3, 53, 3, 54, 55, 56, 57, 58, 3, 59, 60, 61, 3, 62, 63, 64, 65, 66, 3, 67, 68, 11, 69, 70, 71, 72, 3, 73, 74, 75, 3, 76, 3]

cp's OEIS Frontend

A322973 Lexicographically earliest such sequence a that a(i) = a(j) => f(i) = f(j) for all i, j, where f(1) = 0, f(n) = -1 if n is an odd prime, and f(n) = A006370(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	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	29
40	30
41	3
42	31
43	3
44	32
45	33
46	34
47	3
48	35
49	36
50	37
51	38
52	39
53	3
54	40
55	41
56	7
57	42
58	43
59	3
60	44
61	3
62	45
63	46
64	47
65	48
66	49
67	3
68	50
69	51
70	52
71	3
72	53
73	3
74	54
75	55
76	56
77	57
78	58
79	3
80	59
81	60
82	61
83	3
84	62
85	63
86	64
87	65
88	66
89	3
90	67
91	68
92	11
93	69
94	70
95	71
96	72
97	3
98	73
99	74
100	75
101	3
102	76
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	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	29
40	30
41	3
42	31
43	3
44	32
45	33
46	34
47	3
48	35
49	36
50	37
51	38
52	39
53	3
54	40
55	41
56	7
57	42
58	43
59	3
60	44
61	3
62	45
63	46
64	47
65	48
66	49
67	3
68	50
69	51
70	52
71	3
72	53
73	3
74	54
75	55
76	56
77	57
78	58
79	3
80	59
81	60
82	61
83	3
84	62
85	63
86	64
87	65
88	66
89	3
90	67
91	68
92	11
93	69
94	70
95	71
96	72
97	3
98	73
99	74
100	75
101	3
102	76
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	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	29
40	30
41	3
42	31
43	3
44	32
45	33
46	34
47	3
48	35
49	36
50	37
51	38
52	39
53	3
54	40
55	41
56	7
57	42
58	43
59	3
60	44
61	3
62	45
63	46
64	47
65	48
66	49
67	3
68	50
69	51
70	52
71	3
72	53
73	3
74	54
75	55
76	56
77	57
78	58
79	3
80	59
81	60
82	61
83	3
84	62
85	63
86	64
87	65
88	66
89	3
90	67
91	68
92	11
93	69
94	70
95	71
96	72
97	3
98	73
99	74
100	75
101	3
102	76
103	3