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.

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

Table of values

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

List of values

[1, 1, 2, 1, 3, 5, 1, 2, 3, 6, 1, 5, 3, 6, 11, 1, 3, 4, 10, 7, 9, 1, 3, 4, 8, 5, 10, 9, 1, 4, 5, 0, 7, 10, 17, 13, 1, 3, 4, 0, 7, 18, 15, 11, 16, 1, 3, 4, 5, 7, 14, 9, 11, 13, 19, 1, 3, 4, 5, 6, 0, 10, 9, 14, 17, 16, 1, 3, 4, 5, 8, 9, 10, 18, 23, 17, 15, 27, 1, 3, 4, 0, 6, 26, 9, 15, 14, 11]