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.

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

Table of values

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

List of values

[0, 1, 2, 3, 4, 5, 6, 0, 11, 11, 11, 11, 11, 11, 0, 11, 22, 22, 22, 22, 22, 0, 11, 22, 33, 33, 33, 33, 0, 11, 22, 33, 44, 44, 44, 0, 11, 22, 33, 44, 55, 55, 0, 11, 22, 33, 44, 55, 66, 0, 101, 101, 101, 101, 101, 101, 0, 111, 111, 111, 111, 111, 111, 0, 121, 121, 121, 121, 121, 121, 0, 131, 131, 131, 131, 131, 131, 0]