A390882 Number of shortest strings containing all binary palindromes of length n as substrings.

1, 2, 2, 2, 2, 2, 16, 960, 176

Offset

0,2

Comments

Length of such shortest superstrings is given by A330022(n).

For n > 0, a(n) is even as inverting each bit in a shortest superstring, as well as reading it backwards, produces another shortest superstring.

Links

Table of n, a(n) for n=0..8.

Crossrefs

Cf. A057148, A330022.

Sequence in context: A060359 A376010 A029665 * A256223 A056993 A338931

Adjacent sequences: A390879 A390880 A390881 * A390883 A390884 A390885

Keyword

nonn,hard,more

Author

Max Alekseyev, Nov 22 2025

Extensions

Omitted term a(6) inserted by Christian Sievers, Nov 24 2025

Status

approved