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.

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

Table of values

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

List of values

[0, 1, 2, 3, 4, 5, 0, 7, 7, 7, 7, 7, 0, 7, 14, 14, 14, 14, 0, 7, 14, 21, 21, 21, 0, 7, 14, 21, 28, 28, 0, 7, 14, 21, 28, 35, 0, 37, 37, 37, 37, 37, 0, 43, 43, 43, 43, 43, 0, 49, 49, 49, 49, 49, 0, 55, 55, 55, 55, 55, 0, 61, 61, 61, 61, 61, 0, 67, 67, 67, 67, 67, 0, 37, 74, 74, 74, 74, 0, 43, 80, 80, 80, 80, 0, 49, 86]