A361335 Smallest decimal number containing n palindromic substrings (Version 1). See Comments for precise definition.

0, 10, 11, 101, 1001, 111, 1110, 10101, 10111, 1111, 11110, 102222, 101111, 1001111, 11111, 111110, 1022222, 1011111, 10011111, 11101111, 111111, 1111110, 10222222, 10111111, 100111111, 111111212, 110111111, 1111111, 11111110, 102222222, 101111111, 1001111111, 1111111212, 1101111111, 10101111111, 11111111, 111111110

Offset

1,2

Comments

Suppose m has decimal expansion d_1 d_2 ... d_k. A palindromic substring here is any substring d_i, d_{i+1}, ..., d_j with 1 <= i <= j <= n which is palindromic, except that if d_i = 0 then i = j. For example, if m = 10^3 + 1 = 1001 there are five substrings: 1, 0, 0, 1, 1001 (but not 00). See A361336 for Version 2.

Links

Giovanni Resta, Table of n, a(n) for n = 1..99

Crossrefs

Cf. A361336.

Sequence in context: A362917 A305379 A004685 * A171000 A346821 A222365

Adjacent sequences: A361332 A361333 A361334 * A361336 A361337 A361338

Keyword

nonn,base

Author

N. J. A. Sloane, Apr 01 2023, based on postings to the Sequence Fans Mailing list by Eric Angelini, Mar 28 2023 (definition), and Giovanni Resta, Mar 28 2023 (terms)

Status

approved