A323074 - cp's OEIS frontend

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

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

cp's OEIS Frontend

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

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

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