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.

A343921 The maximum number of times a positive number can be added to n such that the digits in each resulting sum are distinct.

Table of values

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

List of values

[36, 9, 12, 13, 12, 11, 15, 12, 11, 26, 14, 13, 23, 11, 11, 13, 26, 11, 12, 12, 13, 23, 14, 11, 24, 12, 13, 35, 25, 12, 12, 16, 13, 12, 12, 11, 13, 11, 17, 12, 13, 12, 15, 9, 12, 12, 25, 9, 14, 22, 12, 23, 12, 25, 34, 11, 11, 13, 22, 11, 16, 12, 14, 12, 12, 24, 13, 13, 15, 12, 13, 10, 11, 11, 9]

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

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