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.

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

Table of values

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

List of values

[0, 1, 2, 3, 4, 0, 11, 11, 11, 11, 0, 11, 22, 22, 22, 0, 11, 22, 33, 33, 0, 11, 22, 33, 44, 0, 101, 101, 101, 101, 0, 111, 111, 111, 111, 0, 121, 121, 121, 121, 0, 131, 131, 131, 131, 0, 141, 141, 141, 141, 0, 101, 202, 202, 202, 0, 111, 212, 212, 212, 0, 121, 222, 222, 222, 0, 131, 232, 232, 232, 0, 141, 242, 242, 242]