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.

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

Table of values

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

List of values

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