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.

A112388 a(n) is the smallest prime p such that p^n contains every digit.

Table of values

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

List of values

[10123457689, 101723, 5437, 2339, 1009, 257, 139, 173, 83, 67, 31, 29, 37, 17, 17, 47, 19, 7, 5, 23, 23, 5, 11, 11, 17, 5, 5, 5, 5, 11, 5, 11, 11, 5, 5, 7, 5, 7, 3, 5, 5, 7, 7, 7, 3, 7, 3, 3, 5, 5, 5, 5, 3, 7, 7, 5, 3, 7, 5, 3, 3, 3, 3, 3, 3, 5, 3, 2, 3, 2, 3, 3, 3, 3, 5, 3, 3, 3, 2, 3, 5, 2]