A323081 - cp's OEIS frontend

A323081 Lexicographically earliest such sequence a that for all i, j, a(i) = a(j) => f(i) = f(j), where f(p) = -(p mod 4) for primes p, and f(n) = A252463(n) for any other numbers.

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

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

cp's OEIS Frontend

A323081 Lexicographically earliest such sequence a that for all i, j, a(i) = a(j) => f(i) = f(j), where f(p) = -(p mod 4) for primes p, and f(n) = A252463(n) for any other numbers.

Table of values

List of values

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

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

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