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.

A070244 Largest palindrome using minimum number of digits with a digit sum = 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 55
11 515
12 66
13 616
14 77
15 717
16 88
17 818
18 99
19 919
20 929
21 939
22 949
23 959
24 969
25 979
26 989
27 999
28 9559
29 95159
30 9669
31 96169
32 9779
33 97179
34 9889
35 98189
36 9999
37 99199
38 99299
39 99399
40 99499
41 99599
42 99699
43 99799
44 99899
45 99999

List of values

[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 55, 515, 66, 616, 77, 717, 88, 818, 99, 919, 929, 939, 949, 959, 969, 979, 989, 999, 9559, 95159, 9669, 96169, 9779, 97179, 9889, 98189, 9999, 99199, 99299, 99399, 99499, 99599, 99699, 99799, 99899, 99999]