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.

A080501 Let f(n) be the smallest multiple of n that can be obtained by inserting digits anywhere in n except that f(n) is not equal to 10*n; a(n) = f(n)/n.

Table of values

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

List of values

[11, 6, 11, 6, 3, 6, 11, 6, 11, 11, 11, 11, 11, 11, 7, 11, 11, 6, 61, 6, 11, 11, 11, 11, 5, 11, 11, 26, 71, 11, 11, 11, 11, 11, 9, 11, 83, 36, 61, 6, 11, 11, 11, 11, 9, 31, 31, 26, 51, 3, 11, 11, 11, 11, 21, 26, 89, 26, 27, 6, 11, 11, 11, 26, 21, 51, 25, 26, 39, 11, 11, 11, 51, 51, 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.