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.

A337857 a(n) is the smallest positive integer m with no repeated digits such that A137564(n + m) = n, or a(n) = 0 if no m exists.

Table of values

n a(n)
1 10
2 20
3 30
4 40
5 50
6 60
7 70
8 80
9 90
10 90
11 0
12 109
13 120
14 127
15 136
16 145
17 154
18 163
19 172
20 180
21 190
22 0
23 209
24 218
25 230
26 236
27 245
28 254
29 263
30 270
31 280
32 290
33 0
34 309
35 318
36 327
37 340
38 345
39 354
40 360
41 370
42 380
43 390
44 0
45 409
46 418
47 427
48 436
49 450
50 450
51 460
52 470
53 480
54 490
55 0
56 509
57 518
58 527
59 536
60 540

List of values

[10, 20, 30, 40, 50, 60, 70, 80, 90, 90, 0, 109, 120, 127, 136, 145, 154, 163, 172, 180, 190, 0, 209, 218, 230, 236, 245, 254, 263, 270, 280, 290, 0, 309, 318, 327, 340, 345, 354, 360, 370, 380, 390, 0, 409, 418, 427, 436, 450, 450, 460, 470, 480, 490, 0, 509, 518, 527, 536, 540]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.