Maximal number of longest common subsequences between any two strings of length n (Version 2).
A094863
Maximal number of longest common subsequences between any two strings of length n (Version 2).
Terms
- a(0) =1a(1) =2a(2) =3a(3) =4a(4) =7a(5) =10a(6) =19a(7) =28
External references
- oeis: A094863