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

A094837

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

Terms

    a(0) =1a(1) =2a(2) =4a(3) =10a(4) =24a(5) =46a(6) =100a(7) =225a(8) =525a(9) =1225a(10) =3136a(11) =7056a(12) =17640a(13) =44100a(14) =108900a(15) =261360a(16) =637065a(17) =1656369a(18) =4008004a(19) =10020010a(20) =25050025a(21) =64128064a(22) =155739584a(23) =393853824a(24) =1012766976

External references