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.

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

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

List of values

[0, 1, 2, 3, 4, 5, 6, 7, 0, 9, 9, 9, 9, 9, 9, 9, 0, 9, 18, 18, 18, 18, 18, 18, 0, 9, 18, 27, 27, 27, 27, 27, 0, 9, 18, 27, 36, 36, 36, 36, 0, 9, 18, 27, 36, 45, 45, 45, 0, 9, 18, 27, 36, 45, 54, 54, 0, 9, 18, 27, 36, 45, 54, 63, 0, 65, 65, 65, 65, 65, 65, 65, 0, 73, 73, 73, 73, 73, 73, 73, 0, 81, 81, 81, 81, 81, 81, 81]