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.

A069521 Smallest multiple of n with digit sum = 2, or 0 if no such number exists, e.g., a(3k)=0.

Table of values

n a(n)
1 2
2 2
3 0
4 20
5 20
6 0
7 1001
8 200
9 0
10 20
11 11
12 0
13 1001
14 10010
15 0
16 2000
17 100000001
18 0
19 1000000001
20 20
21 0
22 110
23 100000000001
24 0
25 200
26 10010
27 0
28 100100
29 100000000000001
30 0
31 0
32 20000
33 0
34 1000000010
35 10010
36 0
37 0
38 10000000010
39 0
40 200
41 0
42 0
43 0
44 1100
45 0

List of values

[2, 2, 0, 20, 20, 0, 1001, 200, 0, 20, 11, 0, 1001, 10010, 0, 2000, 100000001, 0, 1000000001, 20, 0, 110, 100000000001, 0, 200, 10010, 0, 100100, 100000000000001, 0, 0, 20000, 0, 1000000010, 10010, 0, 0, 10000000010, 0, 200, 0, 0, 0, 1100, 0]