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.

A265514 a(n) = largest base-4 palindrome m <= n such that every base-4 digit of m is <= the corresponding digit of n; m is written in base 4.

Table of values

n a(n)
0 0
1 1
2 2
3 3
4 0
5 11
6 11
7 11
8 0
9 11
10 22
11 22
12 0
13 11
14 22
15 33
16 0
17 101
18 101
19 101
20 0
21 111
22 111
23 111
24 0
25 121
26 121
27 121
28 0
29 131
30 131
31 131
32 0
33 101
34 202
35 202
36 0
37 111
38 212
39 212
40 0
41 121
42 222
43 222
44 0
45 131
46 232
47 232
48 0
49 101
50 202
51 303
52 0
53 111
54 212
55 313
56 0
57 121
58 222
59 323
60 0
61 131
62 232
63 333
64 0
65 1001
66 1001
67 1001
68 0
69 1001
70 1001
71 1001
72 0

List of values

[0, 1, 2, 3, 0, 11, 11, 11, 0, 11, 22, 22, 0, 11, 22, 33, 0, 101, 101, 101, 0, 111, 111, 111, 0, 121, 121, 121, 0, 131, 131, 131, 0, 101, 202, 202, 0, 111, 212, 212, 0, 121, 222, 222, 0, 131, 232, 232, 0, 101, 202, 303, 0, 111, 212, 313, 0, 121, 222, 323, 0, 131, 232, 333, 0, 1001, 1001, 1001, 0, 1001, 1001, 1001, 0]