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.

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

Table of values

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

List of values

[0, 1, 2, 3, 0, 5, 5, 5, 0, 5, 10, 10, 0, 5, 10, 15, 0, 17, 17, 17, 0, 21, 21, 21, 0, 25, 25, 25, 0, 29, 29, 29, 0, 17, 34, 34, 0, 21, 38, 38, 0, 25, 42, 42, 0, 29, 46, 46, 0, 17, 34, 51, 0, 21, 38, 55, 0, 25, 42, 59, 0, 29, 46, 63, 0, 65, 65, 65, 0, 65, 65, 65, 0, 65, 65, 65, 0, 65, 65, 65, 0, 65, 65, 65, 0, 85, 85]