A322810 - cp's OEIS frontend

A322810 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 squarefree number > 1, and f(n) = n for all other numbers.

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

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

cp's OEIS Frontend

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