A094859 Maximal number of longest common subsequences between any two ternary strings of length n (Version 2).

1, 2, 3, 4, 6, 10

Offset: 1

Author

Guenter Stertenbrink (Sterten(AT)aol.com), Jun 14 2004

Keywords

• nonn
• more

Comments

Same as A094858 but now we can use an alphabet of size 3.