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.

A262257 Minimal number of editing steps (delete, insert or substitute) to transform n in decimal representation into the largest palindrome <= n.

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 2
11 0
12 1
13 1
14 1
15 1
16 1
17 1
18 1
19 1
20 2
21 1
22 0
23 1
24 1
25 1
26 1
27 1
28 1
29 1
30 2
31 2
32 1
33 0
34 1
35 1
36 1
37 1
38 1
39 1
40 2
41 2
42 2
43 1
44 0
45 1
46 1
47 1
48 1
49 1
50 2
51 2
52 2
53 2
54 1
55 0
56 1
57 1
58 1
59 1
60 2
61 2
62 2
63 2
64 2
65 1
66 0
67 1
68 1
69 1
70 2
71 2
72 2
73 2
74 2
75 2
76 1
77 0
78 1
79 1
80 2
81 2
82 2
83 2
84 2
85 2

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 0, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 0, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 0, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 0, 1, 1, 2, 2, 2, 2, 2, 2]