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.

A248040 Numbers n such that n*digsum(n) contains the same distinct digits as n.

Table of values

n a(n)
1 1
2 10
3 100
4 109
5 190
6 208
7 280
8 307
9 370
10 406
11 450
12 460
13 505
14 550
15 604
16 640
17 703
18 730
19 802
20 820
21 901
22 910
23 1000
24 1009
25 1018
26 1027
27 1036
28 1045
29 1054
30 1063
31 1072
32 1081
33 1090
34 1108
35 1168
36 1180
37 1207
38 1270
39 1286
40 1306
41 1360
42 1405
43 1450
44 1504
45 1540
46 1603
47 1630
48 1702
49 1720
50 1726
51 1801

List of values

[1, 10, 100, 109, 190, 208, 280, 307, 370, 406, 450, 460, 505, 550, 604, 640, 703, 730, 802, 820, 901, 910, 1000, 1009, 1018, 1027, 1036, 1045, 1054, 1063, 1072, 1081, 1090, 1108, 1168, 1180, 1207, 1270, 1286, 1306, 1360, 1405, 1450, 1504, 1540, 1603, 1630, 1702, 1720, 1726, 1801]