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.

A106848 a(n) = the number of times the last digit of n must be appended to n to form a number m such that n divides m, or 0 if no such m exists.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 0, 6, 6, 3, 0, 16, 9, 18, 1, 6, 2, 22, 0, 0, 6, 27, 6, 28, 1, 15, 0, 2, 16, 6, 0, 3, 18, 6, 1, 5, 6, 21, 2, 9, 22, 46, 0, 42, 1, 48, 0, 13, 27, 2, 0, 18, 28, 58, 1, 60, 15, 6, 0, 6, 2, 33, 16, 22, 1, 35, 0, 8, 3, 0, 0, 2, 6, 13, 1, 81, 5, 41, 6, 16, 21, 84, 2, 44, 1]