1 problem

For $k\geq2$, let $C_k(n)$ be the number of partitions of $[n]$ avoiding classical $k$-crossings, and let $E_k(n)$ be the number avoiding enhanced $k$-crossings. Binomial-transform…