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.

A343924 a(n) = the maximum number of times n can be multiplied by a number > 1 such that each product has distinct digits.

Table of values

n a(n)
1 15
2 14
3 10
4 13
5 10
6 9
7 6
8 12
9 5
10 9
11 3
12 8
13 6
14 6
15 10
16 11
17 3
18 4
19 5
20 8
21 5
22 4
23 6
24 7
25 3
26 6
27 10
28 3
29 4
30 9
31 4
32 10
33 3
34 4
35 5
36 4
37 4
38 4
39 6
40 7
41 3
42 3
43 2
44 4
45 4
46 5
47 2
48 6
49 5
50 4
51 8
52 4
53 3
54 9
55 3
56 3
57 3
58 4
59 4
60 8
61 3
62 3
63 3
64 9
65 4
66 5
67 4
68 3
69 4
70 5
71 3
72 3
73 4
74 4
75 4
76 3
77 4
78 5
79 5
80 6
81 4
82 2
83 3
84 2
85 4
86 3
87 3
88 7
89 5
90 5
91 4
92 4
93 2
94 2
95 4
96 5

List of values

[15, 14, 10, 13, 10, 9, 6, 12, 5, 9, 3, 8, 6, 6, 10, 11, 3, 4, 5, 8, 5, 4, 6, 7, 3, 6, 10, 3, 4, 9, 4, 10, 3, 4, 5, 4, 4, 4, 6, 7, 3, 3, 2, 4, 4, 5, 2, 6, 5, 4, 8, 4, 3, 9, 3, 3, 3, 4, 4, 8, 3, 3, 3, 9, 4, 5, 4, 3, 4, 5, 3, 3, 4, 4, 4, 3, 4, 5, 5, 6, 4, 2, 3, 2, 4, 3, 3, 7, 5, 5, 4, 4, 2, 2, 4, 5]