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.

A309007 Largest k such that n^k has distinct digits in base 10 (for n>1).

Table of values

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

List of values

[29, 9, 10, 8, 4, 8, 5, 3, 1, 0, 4, 4, 5, 1, 5, 6, 4, 3, 1, 3, 3, 4, 3, 4, 1, 3, 2, 3, 1, 2, 4, 2, 1, 3, 2, 2, 5, 1, 1, 3, 2, 2, 4, 1, 1, 1, 4, 4, 1, 2, 2, 2, 2, 2, 1, 2, 1, 3, 1, 2, 1, 1, 2, 1, 3, 1, 1, 3, 1, 2, 2, 3, 2, 3, 3, 0, 2, 2, 1, 1, 2, 1, 3, 1, 2, 2]