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.

A342143 Take a(n), sort its digits into ascending order, divide the larger of the two numbers by the smaller and keep only the remainder: this remainder is present in a(n) as a substring of its digits.

Table of values

n a(n)
1 10
2 20
3 30
4 40
5 50
6 52
7 60
8 70
9 80
10 90
11 98
12 100
13 105
14 106
15 108
16 110
17 120
18 130
19 140
20 150
21 160
22 170
23 180
24 186
25 190
26 198
27 200
28 205
29 220
30 230
31 240
32 250
33 251
34 260
35 270
36 274
37 280
38 290
39 298
40 300
41 302
42 330
43 340
44 350
45 360
46 370
47 380
48 390
49 398
50 400
51 405
52 410
53 440
54 450
55 460
56 470
57 480
58 490
59 498
60 500
61 502
62 510
63 511

List of values

[10, 20, 30, 40, 50, 52, 60, 70, 80, 90, 98, 100, 105, 106, 108, 110, 120, 130, 140, 150, 160, 170, 180, 186, 190, 198, 200, 205, 220, 230, 240, 250, 251, 260, 270, 274, 280, 290, 298, 300, 302, 330, 340, 350, 360, 370, 380, 390, 398, 400, 405, 410, 440, 450, 460, 470, 480, 490, 498, 500, 502, 510, 511]