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.

A378771 a(n) is the least k such that the last k digits of m = A020666(n)^n contain all 10 possible digits (0 through 9).

Table of values

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

List of values

[10, 10, 10, 11, 13, 11, 13, 17, 15, 16, 15, 15, 16, 18, 17, 15, 17, 15, 13, 16, 17, 15, 24, 17, 23, 16, 19, 20, 20, 22, 22, 25, 32, 17, 20, 23, 20, 19, 19, 23, 19, 14, 21, 19, 17, 25, 22, 17, 27, 19, 24, 13, 20, 28, 18, 33, 26, 18, 33, 22, 23, 20, 25, 25, 25, 22]

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

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