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.

A265509 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 10.

Table of values

n a(n)
0 1
1 3
2 5
3 7
4 9
5 9
6 9
7 15
8 17
9 17
10 21
11 21
12 17
13 27
14 21
15 31
16 33
17 33
18 33
19 33
20 33
21 33
22 45
23 45
24 33
25 51
26 33
27 51
28 33
29 51
30 45
31 63
32 65
33 65
34 65
35 65
36 73
37 73
38 73
39 73
40 65
41 65
42 85
43 85
44 73
45 73
46 93
47 93
48 65
49 99
50 65
51 99
52 73
53 107
54 73
55 107
56 65
57 99
58 85
59 119
60 73
61 107
62 93
63 127
64 129
65 129
66 129
67 129
68 129
69 129
70 129
71 129
72 129
73 129
74 129
75 129
76 153

List of values

[1, 3, 5, 7, 9, 9, 9, 15, 17, 17, 21, 21, 17, 27, 21, 31, 33, 33, 33, 33, 33, 33, 45, 45, 33, 51, 33, 51, 33, 51, 45, 63, 65, 65, 65, 65, 73, 73, 73, 73, 65, 65, 85, 85, 73, 73, 93, 93, 65, 99, 65, 99, 73, 107, 73, 107, 65, 99, 85, 119, 73, 107, 93, 127, 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, 153]