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.

A265510 a(n) = largest base-2 palindrome m <= 2n+1 such that every base-2 digit of m is <= the corresponding digit of 2n+1; m is written in base 2.

Table of values

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

List of values

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

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

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