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.

A216482 a(n) is the least value of k such that k*n uses only digits 1 and 2. a(n) = -1 if no such multiple exists.

Table of values

n a(n)
1 1
2 1
3 4
4 3
5 -1
6 2
7 3
8 14
9 1358
10 -1
11 1
12 1
13 17
14 8
15 -1
16 7
17 13
18 679
19 59
20 -1
21 1
22 1
23 527
24 88
25 -1
26 47
27 786
28 4
29 418
30 -1
31 362
32 66
33 34
34 33
35 -1
36 617
37 3
38 319
39 2849
40 -1
41 271
42 291
43 284
44 48
45 -1
46 2657
47 26
48 44
49 229
50 -1
51 22
52 406
53 4
54 393
55 -1
56 2
57 3723
58 209
59 19
60 -1
61 2
62 181
63 194
64 33
65 -1
66 17
67 33
68 1634
69 3219
70 -1
71 172
72 1696
73 2907
74 3
75 -1
76 1462
77 1443
78 1554
79 28
80 -1
81 262
82 271
83 134
84 1443

List of values

[1, 1, 4, 3, -1, 2, 3, 14, 1358, -1, 1, 1, 17, 8, -1, 7, 13, 679, 59, -1, 1, 1, 527, 88, -1, 47, 786, 4, 418, -1, 362, 66, 34, 33, -1, 617, 3, 319, 2849, -1, 271, 291, 284, 48, -1, 2657, 26, 44, 229, -1, 22, 406, 4, 393, -1, 2, 3723, 209, 19, -1, 2, 181, 194, 33, -1, 17, 33, 1634, 3219, -1, 172, 1696, 2907, 3, -1, 1462, 1443, 1554, 28, -1, 262, 271, 134, 1443]