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.

A180012 a(n) = smallest k >= 1 such that k and k*n have the same digit sum.

Table of values

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

List of values

[1, 9, 9, 3, 9, 9, 3, 9, 9, 1, 99, 9, 9, 9, 9, 9, 9, 9, 6, 9, 54, 6, 9, 9, 6, 9, 9, 4, 9, 9, 33, 36, 99, 3, 9, 9, 3, 9, 9, 3, 27, 27, 24, 99, 9, 5, 9, 9, 9, 9, 63, 6, 27, 45, 2, 9, 9, 9, 9, 9, 33, 18, 18, 5, 18, 99, 3, 9, 9, 3, 72, 45, 7, 18, 18, 15, 99, 9, 9, 9, 63, 5, 27, 18, 6, 27, 36, 15, 9, 9, 11]