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.

A061916 Obtain m by omitting trailing zeros from n; a(n) = smallest k such that k*m is a palindrome with even digits, or -1 if no such multiple exists.

Table of values

n a(n)
0 1
1 2
2 1
3 2
4 1
5 -1
6 1
7 98
8 1
9 74
10 2
11 2
12 37
13 154
14 49
15 -1
16 29
17 38
18 37
19 34
20 1
21 286
22 1
23 36
24 37
25 -1
26 77
27 329144
28 31
29 16
30 2
31 28
32 132
33 2
34 19
35 -1
36 23
37 6
38 17
39 154
40 1
41 542
42 143
43 1602
44 1
45 -1
46 18
47 6
48 88
49 14
50 -1
51 824
52 77
53 8
54 164572
55 -1
56 143
57 1198
58 8
59 1154
60 1
61 1126
62 14
63 962
64 66
65 -1
66 1
67 998
68 121
69 12
70 98
71 65984
72 592
73 274
74 3
75 -1
76 529
77 26
78 77
79 358

List of values

[1, 2, 1, 2, 1, -1, 1, 98, 1, 74, 2, 2, 37, 154, 49, -1, 29, 38, 37, 34, 1, 286, 1, 36, 37, -1, 77, 329144, 31, 16, 2, 28, 132, 2, 19, -1, 23, 6, 17, 154, 1, 542, 143, 1602, 1, -1, 18, 6, 88, 14, -1, 824, 77, 8, 164572, -1, 143, 1198, 8, 1154, 1, 1126, 14, 962, 66, -1, 1, 998, 121, 12, 98, 65984, 592, 274, 3, -1, 529, 26, 77, 358]