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.

A259085 a(n) = largest k such that the decimal representation of prime(n)^k does not contain the digit 1, or -1 if no such k exists.

Table of values

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

List of values

[91, 43, 42, 30, -1, 14, 13, 23, 7, 3, -1, 6, -1, 3, 5, 2, 19, -1, 9, -1, 17, 5, 6, 9, 6, -1, -1, -1, 11, -1, 13, -1, 7, -1, 5, -1, 5, 3, 13, 6, 7, -1, -1, 7, 10, 15, -1, 2, 5, 7, 2, 9, -1, -1, 2, 6, 1, -1, 2, -1, 21, 2, 3, -1, 3, 11, -1, 5, 11, 3, 3, 3, 5, 1]