A323079 - cp's OEIS frontend

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

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

cp's OEIS Frontend

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

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

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