|
%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
|
