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

Author

Franz Vrabec, Oct 19 2024

Keywords

• nonn
• base
• easy

Comments

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

Examples

			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.

Formula

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

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