106534

Appears in sequences

• 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.at n=10A378382
• Triangle read by rows: T(n,k) is the number of maximal chains in the poset of all k-ary words of length <= n, ordered by B covers A iff A_i <= B_{i+k} for all i in A and some k >= 0.at n=46A378588