A323168 - cp's OEIS frontend

A323168 Lexicographically earliest sequence such that for all i, j, a(i) = a(j) => f(i) = f(j), where f(n) = [A322867(n), A323174(n)] for n > 1, and f(1) = 0.

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

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

cp's OEIS Frontend

A323168 Lexicographically earliest sequence such that for all i, j, a(i) = a(j) => f(i) = f(j), where f(n) = [A322867(n), A323174(n)] for n > 1, and f(1) = 0.

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

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

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