A262190 Number of distinct palindromes contained as substrings in the decimal representation of n.

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3

Offset: 0

Author

Reinhard Zumkeller, Sep 14 2015

Keywords

• nonn
• base

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
• Index entries for sequences related to palindromes

Crossrefs

Length of row n in table A262188.

Cf. A055642, A262198.

Programs

Haskell

a262190 = length . a262188_row

PARI

A262190(n)=#A262188_row(n) \\ M. F. Hasler, Jun 19 2018

Formula

a(n) = A055642(n) for n < 100 = A262198(1);

a(n) != A055642(n) iff n is in A262198.

Extensions

Edited by M. F. Hasler, Jun 19 2018