close
login
A378382
Number of maximal chains in the poset of compositions with weight <= n and parts of size <= 2, ordered by A covers B iff A_i >= B_{i+k} for all i in B and some k >= 0.
3
1, 1, 2, 5, 16, 57, 226, 961, 4376, 21041, 106534, 563961, 3112924, 17839993, 105907946, 649432673, 4105783696, 26706965985, 178466243662, 1223248786921, 8589272300516, 61708802126441, 453143009601682, 3397715981566545, 25990997059282456, 202666687407866257
OFFSET
0,3
EXAMPLE
a(3) = 5:
() < (1) < (1,1) < (1,1,1),
() < (1) < (1,1) < (1,2),
() < (1) < (1,1) < (2,1),
() < (1) < (2) < (1,2),
() < (1) < (2) < (2,1).
PROG
(Python)
def mchains(n, k): return # See A378588
def A378382_list(max_n): return mchains(max_n, 2)
CROSSREFS
Cf. A034841, A143672, A282698, A317145, column k=2 of A378588, A378608.
Sequence in context: A197158 A188314 A114296 * A121689 A357580 A192635
KEYWORD
nonn
AUTHOR
John Tyler Rascoe, Nov 26 2024
EXTENSIONS
Name corrected by John Tyler Rascoe, Jul 10 2026
STATUS
approved