A323082 - cp's OEIS frontend

A323082 Lexicographically earliest such sequence a that a(i) = a(j) => f(i) = f(j) for all i, j, where f(n) = -(n mod 2) if n is a prime, and f(n) = A300840(n) for any other number.

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

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

cp's OEIS Frontend

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

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

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