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.

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

Table of values

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

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.