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.

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

Table of values

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

List of values

[0, 1, 2, 3, 4, 5, 0, 11, 11, 11, 11, 11, 0, 11, 22, 22, 22, 22, 0, 11, 22, 33, 33, 33, 0, 11, 22, 33, 44, 44, 0, 11, 22, 33, 44, 55, 0, 101, 101, 101, 101, 101, 0, 111, 111, 111, 111, 111, 0, 121, 121, 121, 121, 121, 0, 131, 131, 131, 131, 131, 0, 141, 141, 141, 141, 141, 0, 151, 151, 151, 151, 151, 0, 101, 202, 202]