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.

A061816 Obtain m by omitting trailing zeros from n (cf. A004151); a(n) = smallest multiple k*m which is a palindrome.

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 1
11 11
12 252
13 494
14 252
15 525
16 272
17 272
18 252
19 171
20 2
21 252
22 22
23 161
24 696
25 525
26 494
27 999
28 252
29 232
30 3
31 434
32 2112
33 33
34 272
35 525
36 252
37 111
38 494
39 585
40 4
41 656
42 252
43 989
44 44
45 585
46 414
47 141
48 2112
49 343
50 5
51 969
52 676
53 212
54 27972
55 55
56 616
57 171
58 232

List of values

[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 11, 252, 494, 252, 525, 272, 272, 252, 171, 2, 252, 22, 161, 696, 525, 494, 999, 252, 232, 3, 434, 2112, 33, 272, 525, 252, 111, 494, 585, 4, 656, 252, 989, 44, 585, 414, 141, 2112, 343, 5, 969, 676, 212, 27972, 55, 616, 171, 232]