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.

A247045 Triangle read by rows: T(n,k) = least number m > 0 such that m^k in base n contains exactly k distinct digits, 1 <= k <= n.

Table of values

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

List of values

[1, 1, 2, 1, 3, 4, 1, 2, 3, 5, 1, 3, 3, 6, 12, 1, 3, 5, 7, 7, 15, 1, 3, 5, 9, 5, 17, 15, 1, 4, 5, 10, 9, 7, 11, 33, 1, 3, 5, 7, 11, 19, 14, 16, 53, 1, 4, 5, 6, 7, 13, 13, 14, 21, 36, 1, 4, 5, 7, 10, 8, 12, 12, 16, 42, 41, 1, 4, 6, 16, 11, 8, 19, 19, 16, 28, 35, 55, 1, 4, 6, 9, 9, 14, 10, 18, 14]