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.

A265525 a(n) = largest base-10 palindrome m <= n such that every base-10 digit of m is <= the corresponding digit of n.

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

List of values

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