Maximum number of longest common substrings of two binary sequences of length n.
A094824
Maximum number of longest common substrings of two binary sequences of length n.
Terms
- a(0) =1a(1) =2a(2) =2a(3) =2a(4) =3a(5) =3a(6) =4a(7) =6a(8) =6a(9) =7a(10) =7a(11) =8a(12) =8a(13) =10a(14) =11a(15) =12a(16) =14
External references
- oeis: A094824