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

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.

Crossrefs

Cf. A002113, A029742, A136522, A377192.

Sequence in context: A277155 A277159 A011724 * A037807 A037817 A297039

Adjacent sequences: A377188 A377189 A377190 * A377192 A377193 A377194

Keyword

nonn,base,easy

Author

Franz Vrabec, Oct 19 2024

Status

approved