A262198 Numbers such that the number of distinct palindromes contained as substring in their decimal representation differs from the length thereof.

100, 200, 300, 400, 500, 600, 700, 800, 900, 1000, 1001, 1002, 1003, 1004, 1005, 1006, 1007, 1008, 1009, 1010, 1020, 1021, 1030, 1031, 1040, 1041, 1050, 1051, 1060, 1061, 1070, 1071, 1080, 1081, 1090, 1091, 1100, 1200, 1201, 1231, 1241, 1251, 1261, 1271

Offset: 1

Author

Reinhard Zumkeller, Sep 14 2015

Keywords

• nonn
• base

Comments

Or, numbers n such that A055642(n) != A262190(n).

a(22) = 1021 is the first term which differs from "numbers having at least two digits 0 in their decimal representation" (not in OEIS). It seems that A043490 is a subsequence. - M. F. Hasler, Jun 19 2018

Examples

			a(39) = 1201, containing just 3 trivial palindromes 0, 1 and 2;
1202, also of length = 4, contains exactly 4 palindromes 0, 1, 2 and 202, therefore 1202 is not a term.
		

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A055642, A262190, A262188.

Programs

Haskell

a262198 n = a262198_list !! (n-1)
a262198_list = [x | x <- [0..], a055642 x /= a262190 x]

PARI

is(n)=#digits(n)!=A262190(n) \\ M. F. Hasler, Jun 19 2018

Extensions

Definition clarified by M. F. Hasler, Jun 19 2018