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.

A069530 Smallest multiple of n with digit sum = 11, or 0 if no such number exists.

Table of values

n a(n)
1 29
2 38
3 0
4 56
5 65
6 0
7 56
8 56
9 0
10 290
11 209
12 0
13 65
14 56
15 0
16 128
17 119
18 0
19 38
20 380
21 0
22 308
23 92
24 0
25 425
26 182
27 0
28 56
29 29
30 0
31 155
32 128
33 0
34 272
35 245
36 0
37 74
38 38
39 0
40 560
41 164
42 0
43 344
44 308
45 0
46 92
47 47
48 0
49 245
50 650
51 0
52 416
53 371
54 0
55 605
56 56
57 0
58 290
59 236
60 0
61 1037
62 434
63 0
64 128
65 65
66 0
67 335

List of values

[29, 38, 0, 56, 65, 0, 56, 56, 0, 290, 209, 0, 65, 56, 0, 128, 119, 0, 38, 380, 0, 308, 92, 0, 425, 182, 0, 56, 29, 0, 155, 128, 0, 272, 245, 0, 74, 38, 0, 560, 164, 0, 344, 308, 0, 92, 47, 0, 245, 650, 0, 416, 371, 0, 605, 56, 0, 290, 236, 0, 1037, 434, 0, 128, 65, 0, 335]