Enumeration of $(k,2)$-noncrossing partitions

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/166702A set partition is said to be $(k,d)$-noncrossing if it avoids the pattern $12... k12... d$. We find an explicit formula for the ordinary generating function of the number of $(k,d)$-noncrossing partitions of $\{1,2,...,n\}$ when $d=1,2$.9 pages, 1 tableCombinatorics05A05; 05A15Enumeration of $(k,2)$-noncrossing partitionstext