A326199 - cp's OEIS frontend

A326199 Lexicographically earliest sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = [A003557(n), A046523(n), A048250(n)] for all other numbers, except f(n) = 0 for odd primes.

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

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

cp's OEIS Frontend

A326199 Lexicographically earliest sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = [A003557(n), A046523(n), A048250(n)] for all other numbers, except f(n) = 0 for odd primes.

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

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

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