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.

A090493 Least k such that n^k contains all the digits from 0 through 9, or 0 if no such k exists.

Table of values

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

List of values

[0, 68, 39, 34, 19, 20, 18, 28, 24, 0, 23, 22, 22, 21, 12, 17, 14, 21, 17, 51, 17, 18, 14, 19, 11, 18, 13, 11, 12, 39, 11, 14, 16, 14, 19, 10, 13, 14, 17, 34, 11, 17, 13, 16, 15, 11, 12, 12, 9, 18, 16, 11, 13, 10, 12, 7, 13, 11, 11, 20, 14, 18, 13, 14, 10, 13, 10, 9, 11, 18, 15]

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

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