A323080 - cp's OEIS frontend

A323080 Lexicographically earliest such sequence a that for all i, j, a(i) = a(j) => f(i) = f(j), where f(1)=0, and f(n) = A252463(n) for n > 1.

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

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

cp's OEIS Frontend

A323080 Lexicographically earliest such sequence a that for all i, j, a(i) = a(j) => f(i) = f(j), where f(1)=0, and f(n) = A252463(n) for n > 1.

Table of values

List of values

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

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

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