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.

A377191 Smallest number of digits that must be changed in n to obtain a palindrome (without changing the first digit to 0).

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

List of values

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