A322805 - cp's OEIS frontend

A322805 Lexicographically earliest such sequence a that for all i, j, a(i) = a(j) => f(i) = f(j), where f(1)=0, f(2)=1, f(n)=-1 for odd primes, and f(n) = A252463(n) for any other number.

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

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

cp's OEIS Frontend

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

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

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