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.

A241173 Start with n; add to it any of its digits; repeat; a(n) = minimal number of steps needed to reach a palindrome.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 3, 2, 3, 2, 1, 4, 3, 2, 1, 1, 0, 3, 3, 2, 3, 3, 2, 4, 1, 3, 3, 0, 2, 2, 2, 1, 3, 2, 1, 2, 1, 3, 0, 2, 2, 3, 4, 2, 1, 4, 3, 2, 2, 0, 4, 3, 1, 3, 1, 4, 3, 1, 2, 2, 0, 3, 4, 3, 1, 3, 2, 2, 4, 2, 3, 0, 3, 1, 1, 3, 2, 3, 1, 2, 2, 3, 0, 5, 1, 2, 1, 4, 5, 2, 3, 4, 5, 0]