Maximal number of longest common subsequences between any two binary strings of length n (Version 2).
A094858
Maximal number of longest common subsequences between any two binary strings of length n (Version 2).
Terms
- a(0) =1a(1) =2a(2) =2a(3) =4a(4) =4a(5) =6a(6) =8a(7) =11a(8) =15a(9) =20a(10) =26a(11) =36a(12) =51
External references
- oeis: A094858