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.

A241183 Start with n; add to it any of its digits; repeat; a(n) = minimal number of steps needed to reach 2n, or -1 if 2n cannot be reached.

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 4, 4, 3, 3, 5, 4, 4, 3, 7, 6, 5, 5, 5, 4, 5, 5, 5, 4, 5, 7, 6, 6, 7, 6, 6, 7, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, -1, 8, 8, 8, 7, 8, 8, 8, 8, 8, 10, 9, 9, 9, 10, 11, 10, 10, 10, 11, 12, 11, 12, 12, 11, 12, 12, 14, 12, 13, 15, 12, 13, 14, 14, 14, 14, 14, 15, 14, 14, 16, 16, 16, 15, 15, 17, 16, 15, 15, 18]