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.

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

List of values

[0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 10, 10, 10, 10, 10, 10, 10, 10, 0, 10, 20, 20, 20, 20, 20, 20, 20, 0, 10, 20, 30, 30, 30, 30, 30, 30, 0, 10, 20, 30, 40, 40, 40, 40, 40, 0, 10, 20, 30, 40, 50, 50, 50, 50, 0, 10, 20, 30, 40, 50, 60, 60, 60, 0, 10, 20, 30, 40, 50, 60, 70, 70, 0, 10, 20, 30, 40, 50, 60, 70, 80, 0, 82, 82]