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.

A370571 Smallest multiple of n that when written in base 10 uses only 0's and 1's and at least one of each.

Table of values

n a(n)
1 10
2 10
3 1011
4 100
5 10
6 1110
7 1001
8 1000
9 1011111111
10 10
11 110
12 11100
13 1001
14 10010
15 1110
16 10000
17 11101
18 1111111110
19 11001
20 100
21 10101
22 110
23 110101
24 111000
25 100
26 10010
27 1101111111
28 100100
29 1101101
30 1110
31 111011
32 100000
33 1101111
34 111010
35 10010
36 11111111100
37 1110
38 110010
39 10101
40 1000

List of values

[10, 10, 1011, 100, 10, 1110, 1001, 1000, 1011111111, 10, 110, 11100, 1001, 10010, 1110, 10000, 11101, 1111111110, 11001, 100, 10101, 110, 110101, 111000, 100, 10010, 1101111111, 100100, 1101101, 1110, 111011, 100000, 1101111, 111010, 10010, 11111111100, 1110, 110010, 10101, 1000]