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.

A062518 Conjectural largest exponent k such that n^k does not contain all of the digits 0 through 9 (in decimal notation) or 0 if no such k exists (for example if n is a power of 10).

Table of values

n a(n)
1 0
2 168
3 106
4 84
5 65
6 64
7 61
8 56
9 53
10 0
11 41
12 51
13 37
14 34
15 34
16 42
17 27
18 25
19 44
20 168
21 29
22 24
23 50
24 23
25 29
26 31
27 28
28 28
29 45
30 106
31 28
32 18
33 24
34 34
35 18
36 32
37 25
38 17
39 41
40 84
41 23
42 19
43 20
44 29
45 39
46 32
47 15
48 29
49 16
50 65
51 29
52 29
53 30
54 18
55 17
56 33
57 19
58 31
59 27
60 64
61 26
62 19
63 24
64 28
65 17
66 15
67 21
68 25
69 13

List of values

[0, 168, 106, 84, 65, 64, 61, 56, 53, 0, 41, 51, 37, 34, 34, 42, 27, 25, 44, 168, 29, 24, 50, 23, 29, 31, 28, 28, 45, 106, 28, 18, 24, 34, 18, 32, 25, 17, 41, 84, 23, 19, 20, 29, 39, 32, 15, 29, 16, 65, 29, 29, 30, 18, 17, 33, 19, 31, 27, 64, 26, 19, 24, 28, 17, 15, 21, 25, 13]