The number of occurrences of the pattern 21-3. See [[Permutations/#Pattern-avoiding_permutations]] for the definition of the pattern $21\!\!-\!\!3$.

The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, (2,3) are consecutive in a block.

The number of occurrences of the pattern {{1,2},{3}} in a set partition.

The number of occurrences of the arrow pattern 13 with an arrow from 1 to 2 in a permutation. Let $\nu$ be a (partial) permutation of $[k]$ with $m$ letters together with dashes between some of its letters. An occurrence of $\nu$ in a permutation $\tau$ is a subsequence $\tau_{a_1},\dots,\tau_{a_m}$ such that $a_i + 1 = a_{i+1}$ whenever there is a dash between the $i$-th and the $(i+1)$-st letter of $\nu$, which is order isomorphic to $\nu$. Thus, $\nu$ is a vincular pattern, except that it is not required to be a permutation. An arrow pattern of size $k$ consists of such a generalized vincular pattern $\nu$ and arrows $b_1\to c_1, b_2\to c_2,\dots$, such that precisely the numbers $1,\dots,k$ appear in the vincular pattern and the arrows. Let $\Phi$ be the map [[Mp00087]]. Let $\tau$ be a permutation and $\sigma = \Phi(\tau)$. Then a subsequence $w = (x_{a_1},\dots,x_{a_m})$ of $\tau$ is an occurrence of the arrow pattern if $w$ is an occurrence of $\nu$, for each arrow $b\to c$ we have $\sigma(x_b) = x_c$ and $x_1 < x_2 < \dots < x_k$.

The number of occurrences of the pattern 23-1. See [[Permutations/#Pattern-avoiding_permutations]] for the definition of the pattern $23\!\!-\!\!1$.