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.

A381700 a(n) is the smallest multiple k*n that contains all the distinct digits of n, where k > 0 must have at least one digit > 1.

Table of values

n a(n)
1 12
2 12
3 36
4 24
5 15
6 36
7 147
8 48
9 189
10 120
11 132
12 192
13 312
14 714
15 105
16 416
17 714
18 108
19 912
20 120
21 126
22 132
23 322
24 432
25 125
26 624
27 702
28 728
29 928
30 360
31 713
32 832
33 132
34 1394
35 315
36 936
37 703
38 836
39 936
40 240
41 164
42 294
43 344
44 264
45 405
46 644
47 1457
48 384
49 294
50 150
51 153
52 1352
53 1325
54 1458
55 165
56 1456
57 3705
58 1508
59 295

List of values

[12, 12, 36, 24, 15, 36, 147, 48, 189, 120, 132, 192, 312, 714, 105, 416, 714, 108, 912, 120, 126, 132, 322, 432, 125, 624, 702, 728, 928, 360, 713, 832, 132, 1394, 315, 936, 703, 836, 936, 240, 164, 294, 344, 264, 405, 644, 1457, 384, 294, 150, 153, 1352, 1325, 1458, 165, 1456, 3705, 1508, 295]