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.

A061906 Obtain m by omitting trailing zeros from n; a(n) = smallest k such that k*m is a palindrome.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 21
13 38
14 18
15 35
16 17
17 16
18 14
19 9
20 1
21 12
22 1
23 7
24 29
25 21
26 19
27 37
28 9
29 8
30 1
31 14
32 66
33 1
34 8
35 15
36 7
37 3
38 13
39 15
40 1
41 16
42 6
43 23
44 1
45 13
46 9
47 3
48 44
49 7
50 1
51 19
52 13
53 4
54 518
55 1
56 11
57 3
58 4
59 13
60 1
61 442
62 7
63 4
64 33
65 9
66 1
67 11
68 4
69 6
70 1
71 845
72 88
73 4
74 3
75 7
76 287
77 1
78 11
79 6
80 1
81 12345679
82 8

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 21, 38, 18, 35, 17, 16, 14, 9, 1, 12, 1, 7, 29, 21, 19, 37, 9, 8, 1, 14, 66, 1, 8, 15, 7, 3, 13, 15, 1, 16, 6, 23, 1, 13, 9, 3, 44, 7, 1, 19, 13, 4, 518, 1, 11, 3, 4, 13, 1, 442, 7, 4, 33, 9, 1, 11, 4, 6, 1, 845, 88, 4, 3, 7, 287, 1, 11, 6, 1, 12345679, 8]