Number of maximal chains in the poset of all binary words of length <= n, ordered by B covers A iff A_i <= B_{i+k} for all i in A and some k >= 0.
A378382
Number of maximal chains in the poset of all binary words of length <= n, ordered by B covers A iff A_i <= B_{i+k} for all i in A and some k >= 0.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =5a(4) =16a(5) =57a(6) =226a(7) =961a(8) =4376a(9) =21041a(10) =106534a(11) =563961a(12) =3112924a(13) =17839993a(14) =105907946a(15) =649432673a(16) =4105783696a(17) =26706965985a(18) =178466243662
External references
- oeis: A378382