A346488 - cp's OEIS frontend

A346488 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), for all i, j >= 1, where f(n) = 0 if mu(n) = -1, and f(n) = n for all other numbers (with mu = Möbius mu, A008683).

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

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

cp's OEIS Frontend

A346488 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), for all i, j >= 1, where f(n) = 0 if mu(n) = -1, and f(n) = n for all other numbers (with mu = Möbius mu, A008683).

Table of values

List of values

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

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

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