Voozh

A377191

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

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,1011

COMMENTS

The sequence is unbounded, with a(n) = k first occurring at n = A377192(k).

LINKS

Table of n, a(n) for n=0..101.

FORMULA

a(A002113(n)) = 0, a(A029742(n)) > 0.

a(n) = 0 iff A136522(n) = 1, a(n) > 0 iff A136522(n) = 0.

EXAMPLE

a(12) = 1 because 12 is not a palindrome, but changing 1 digit appropriately (either the first or second in this case) yields a palindrome.