cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A265528 Largest base-2 palindrome m <= 2n, written in base 2.

Table of values

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

List of values

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