A308059 - cp's OEIS frontend

A308059 Lexicographically earliest sequence of positive terms such that for any distinct m and n, a(m) XOR (2a(m+1)) <> a(n) XOR (2a(n+1)) (where XOR denotes the bitwise XOR operator).

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

[1, 1, 2, 1, 3, 1, 4, 1, 5, 4, 3, 6, 1, 8, 1, 9, 8, 2, 5, 8, 3, 10, 8, 8, 10, 10, 12, 12, 13, 8, 12, 16, 16, 17, 5, 13, 16, 18, 18, 20, 20, 21, 16, 20, 24, 24, 25, 16, 24, 27, 16, 25, 18, 26, 32, 32, 33, 1, 16, 32, 34, 34, 36, 36, 37, 1, 18, 32, 36, 40, 40, 41]

cp's OEIS Frontend

A308059 Lexicographically earliest sequence of positive terms such that for any distinct m and n, a(m) XOR (2a(m+1)) <> a(n) XOR (2a(n+1)) (where XOR denotes the bitwise XOR operator).

Table of values

List of values

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

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

cp's OEIS Frontend

A308059 Lexicographically earliest sequence of positive terms such that for any distinct m and n, a(m) XOR (2*a(m+1)) <> a(n) XOR (2*a(n+1)) (where XOR denotes the bitwise XOR operator).

Table of values

List of values

A308059 Lexicographically earliest sequence of positive terms such that for any distinct m and n, a(m) XOR (2a(m+1)) <> a(n) XOR (2a(n+1)) (where XOR denotes the bitwise XOR operator).

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