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.

A373203 a(n) = minimum k>1 such that n^k contains all distinct decimal digits of n.

Table of values

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

List of values

[2, 2, 5, 5, 3, 2, 2, 5, 5, 3, 2, 2, 3, 5, 4, 6, 5, 5, 5, 7, 5, 3, 4, 7, 3, 2, 8, 2, 5, 3, 5, 4, 3, 3, 3, 6, 6, 5, 4, 3, 3, 6, 7, 4, 3, 4, 4, 4, 4, 3, 2, 3, 7, 5, 3, 2, 3, 5, 5, 3, 2, 3, 5, 2, 2, 3, 2, 3, 4, 5, 5, 3, 3, 3, 2, 3, 2, 5, 5, 5, 5]

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

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