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.
A378588
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.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =5a(5) =6a(6) =1a(7) =16a(8) =22a(9) =23a(10) =1a(11) =57a(12) =94a(13) =102a(14) =103a(15) =1a(16) =226a(17) =446a(18) =507a(19) =517a(20) =518a(21) =1a(22) =961a(23) =2308a(24) =2764a(25) =2855a(26) =2867a(27) =2868a(28) =1a(29) =4376
External references
- oeis: A378588