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.

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

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.