A094859 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A094859

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

%I #1 Sep 22 2004 03:00:00

%S 1,2,3,4,6,10

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

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

%K nonn,more

%O 1,2

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