A323234 - cp's OEIS frontend

A323234 Lexicographically earliest sequence such that a(i) = a(j) => f(i) = f(j), where f(1) = 0, and for n > 1, f(n) = ordered pair [A053645(n), A079944(n-2)], where A053645(n) gives n without its most significant bit, while A079944(n-2) gives the second most significant bit of n.

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

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

cp's OEIS Frontend

A323234 Lexicographically earliest sequence such that a(i) = a(j) => f(i) = f(j), where f(1) = 0, and for n > 1, f(n) = ordered pair [A053645(n), A079944(n-2)], where A053645(n) gives n without its most significant bit, while A079944(n-2) gives the second most significant bit of n.

Table of values

List of values

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

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

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