A323078 - cp's OEIS frontend

A323078 Lexicographically earliest such sequence a that a(i) = a(j) => f(i) = f(j) for all i, j, where f(n) = 0 if n is an odd prime, and f(n) = A097246(n) for all other numbers.

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

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

cp's OEIS Frontend

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

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

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