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.

A338659 The smallest positive number that can be added to n the maximum number of times, see A343921(n), such that the digits in each resulting sum are distinct, or -1 if no such number exists.

Table of values

n a(n)
0 27
1 1
2 34
3 81
4 15
5 81
6 48
7 86
8 150
9 37
10 355
11 23
12 37
13 47
14 56
15 15
16 37
17 44
18 55
19 37
20 43
21 37
22 14
23 17
24 27
25 340
26 811
27 27
28 37
29 340
30 15
31 37
32 37
33 15
34 23
35 35
36 14
37 91
38 22
39 48
40 44
41 233
42 63
43 33
44 53
45 75
46 37
47 3
48 75
49 37
50 14
51 27
52 811
53 37
54 27
55 88
56 37
57 63
58 37
59 171
60 22
61 391
62 74
63 43
64 44
65 37
66 43
67 480
68 37
69 37
70 478

List of values

[27, 1, 34, 81, 15, 81, 48, 86, 150, 37, 355, 23, 37, 47, 56, 15, 37, 44, 55, 37, 43, 37, 14, 17, 27, 340, 811, 27, 37, 340, 15, 37, 37, 15, 23, 35, 14, 91, 22, 48, 44, 233, 63, 33, 53, 75, 37, 3, 75, 37, 14, 27, 811, 37, 27, 88, 37, 63, 37, 171, 22, 391, 74, 43, 44, 37, 43, 480, 37, 37, 478]