A265543 - cp's OEIS frontend

A265543 a(n) = smallest base-2 palindrome m >= n such that every base-2 digit of n is <= the corresponding digit of m; m is written in base 2.

n	a(n)
0	0
1	1
2	11
3	11
4	101
5	101
6	111
7	111
8	1001
9	1001
10	1111
11	1111
12	1111
13	1111
14	1111
15	1111
16	10001
17	10001
18	11011
19	11011
20	10101
21	10101
22	11111
23	11111
24	11011
25	11011
26	11011
27	11011
28	11111
29	11111
30	11111
31	11111
32	100001
33	100001
34	110011
35	110011
36	101101
37	101101
38	111111
39	111111
40	101101
41	101101
42	111111
43	111111
44	101101
45	101101
46	111111

[0, 1, 11, 11, 101, 101, 111, 111, 1001, 1001, 1111, 1111, 1111, 1111, 1111, 1111, 10001, 10001, 11011, 11011, 10101, 10101, 11111, 11111, 11011, 11011, 11011, 11011, 11111, 11111, 11111, 11111, 100001, 100001, 110011, 110011, 101101, 101101, 111111, 111111, 101101, 101101, 111111, 111111, 101101, 101101, 111111]

cp's OEIS Frontend

A265543 a(n) = smallest base-2 palindrome m >= n such that every base-2 digit of n is <= the corresponding digit of m; m is written in base 2.

Table of values

List of values