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.

A216478 a(n) is the least multiple of n which uses only digits 1 and 2. a(n) = -1 if no such multiple exists.

Table of values

n a(n)
1 1
2 2
3 12
4 12
5 -1
6 12
7 21
8 112
9 12222
10 -1
11 11
12 12
13 221
14 112
15 -1
16 112
17 221
18 12222
19 1121
20 -1
21 21
22 22
23 12121
24 2112
25 -1
26 1222
27 21222
28 112
29 12122
30 -1
31 11222
32 2112
33 1122
34 1122
35 -1
36 22212
37 111
38 12122
39 111111
40 -1
41 11111
42 12222
43 12212
44 2112
45 -1
46 122222
47 1222
48 2112
49 11221
50 -1
51 1122
52 21112
53 212
54 21222
55 -1
56 112
57 212211
58 12122
59 1121

List of values

[1, 2, 12, 12, -1, 12, 21, 112, 12222, -1, 11, 12, 221, 112, -1, 112, 221, 12222, 1121, -1, 21, 22, 12121, 2112, -1, 1222, 21222, 112, 12122, -1, 11222, 2112, 1122, 1122, -1, 22212, 111, 12122, 111111, -1, 11111, 12222, 12212, 2112, -1, 122222, 1222, 2112, 11221, -1, 1122, 21112, 212, 21222, -1, 112, 212211, 12122, 1121]