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.

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

Table of values

n a(n)
1 19
2 28
3 0
4 28
5 55
6 0
7 28
8 64
9 0
10 190
11 55
12 0
13 91
14 28
15 0
16 64
17 136
18 0
19 19
20 280
21 0
22 154
23 46
24 0
25 325
26 208
27 0
28 28
29 145
30 0
31 217
32 64
33 0
34 136
35 280
36 0
37 37
38 190
39 0
40 280
41 82
42 0
43 172
44 352
45 0
46 46
47 235
48 0
49 343
50 550
51 0
52 208
53 424
54 0
55 55
56 280
57 0
58 406
59 118
60 0
61 244
62 1054
63 0
64 64
65 325
66 0
67 1072

List of values

[19, 28, 0, 28, 55, 0, 28, 64, 0, 190, 55, 0, 91, 28, 0, 64, 136, 0, 19, 280, 0, 154, 46, 0, 325, 208, 0, 28, 145, 0, 217, 64, 0, 136, 280, 0, 37, 190, 0, 280, 82, 0, 172, 352, 0, 46, 235, 0, 343, 550, 0, 208, 424, 0, 55, 280, 0, 406, 118, 0, 244, 1054, 0, 64, 325, 0, 1072]