A230891 - cp's OEIS frontend

A230891 Working in base 2: a(0)=0, thereafter a(n+1) is the smallest number not already in the sequence such that the bits of a(n) and a(n+1) together can be rearranged to form a palindrome.

n	a(n)
0	0
1	11
2	1
3	10
4	100
5	111
6	1000
7	101
8	110
9	1001
10	1010
11	1100
12	1111
13	10000
14	1011
15	1101
16	1110
17	10001
18	10010
19	10100
20	10111
21	11000
22	11011
23	11101
24	11110
25	100000
26	10011
27	10101
28	10110
29	11001
30	11010
31	11100
32	11111
33	100001
34	100010
35	100100
36	100111
37	101000
38	101011
39	101101
40	101110
41	110000
42	110011
43	110101
44	110110
45	111001

[0, 11, 1, 10, 100, 111, 1000, 101, 110, 1001, 1010, 1100, 1111, 10000, 1011, 1101, 1110, 10001, 10010, 10100, 10111, 11000, 11011, 11101, 11110, 100000, 10011, 10101, 10110, 11001, 11010, 11100, 11111, 100001, 100010, 100100, 100111, 101000, 101011, 101101, 101110, 110000, 110011, 110101, 110110, 111001]

cp's OEIS Frontend

A230891 Working in base 2: a(0)=0, thereafter a(n+1) is the smallest number not already in the sequence such that the bits of a(n) and a(n+1) together can be rearranged to form a palindrome.

Table of values

List of values