A324401 - cp's OEIS frontend

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

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

cp's OEIS Frontend

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

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

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