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.

A248616 Least number k such that k^k in base n contains all n possible digits.

Table of values

n a(n)
1 1
2 2
3 5
4 6
5 11
6 9
7 9
8 13
9 16
10 19
11 16
12 27
13 19
14 29
15 33
16 35
17 36
18 41
19 36
20 38
21 41
22 34
23 40
24 55
25 56
26 62
27 73
28 65
29 67
30 62
31 70
32 77
33 77
34 74
35 76
36 95
37 92
38 103
39 97
40 91
41 89
42 108
43 96
44 93
45 104
46 118
47 117
48 105
49 125
50 126
51 132
52 112
53 137
54 145
55 132
56 144
57 147
58 126
59 138
60 168
61 141
62 122
63 165
64 185
65 166
66 170
67 187
68 186

List of values

[1, 2, 5, 6, 11, 9, 9, 13, 16, 19, 16, 27, 19, 29, 33, 35, 36, 41, 36, 38, 41, 34, 40, 55, 56, 62, 73, 65, 67, 62, 70, 77, 77, 74, 76, 95, 92, 103, 97, 91, 89, 108, 96, 93, 104, 118, 117, 105, 125, 126, 132, 112, 137, 145, 132, 144, 147, 126, 138, 168, 141, 122, 165, 185, 166, 170, 187, 186]

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

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