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

A094859

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

Terms

    a(0) =1a(1) =2a(2) =3a(3) =4a(4) =6a(5) =10

External references