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,2

Comments

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

Links

Table of n, a(n) for n=1..6.

Crossrefs

Sequence in context: A081419 A108858 A294688 * A267102 A122397 A359679

Adjacent sequences: A094856 A094857 A094858 * A094860 A094861 A094862

Keyword

nonn,more

Author

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

Status

approved