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.

A381578 For n > 0, for k > n, a(n) is the least k such that the pre-period and first period of the decimal expansion of n/k contains every digit of n at least as many times it is contained in n.

Table of values

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

List of values

[6, 7, 8, 7, 7, 9, 8, 9, 10, 17, 17, 14, 17, 17, 17, 17, 19, 19, 21, 21, 23, 23, 29, 28, 27, 27, 28, 29, 32, 31, 34, 34, 38, 38, 38, 38, 38, 39, 46, 43, 42, 43, 46, 46, 46, 47, 49, 49, 51, 51, 53, 53, 57, 56, 57, 57, 58, 59, 61, 61, 62, 63, 65, 65, 68, 67, 68, 69]

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

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