The number of lattice paths of the same length that stay weakly above a Dyck path. In particular, the statistic value is $2^n$ for the Dyck path consisting of $n$ north steps followed by $n$ east steps and the central binomial coefficient $\binom{2n}{n}$ for the Dyck path consisting of $n$ alternating north and east steps. The number of such paths is always even: the final step of a Dyck path $D$ must be a down step. Thus, the final step of a path above $D$ can be arbitrarily chosen.

The number of lattice paths of the same length weakly above the path given by a binary word. In particular, there are $2^n$ lattice paths weakly above the the length $n$ binary word $0\dots 0$, there is a unique path weakly above $1\dots 1$, and there are $\binom{2n}{n}$ paths weakly above the length $2n$ binary word $10\dots 10$.

The pebbling number of a connected graph.

The number of maximal chains in a poset.

The number of permutations greater than or equal to the given permutation in (strong) Bruhat order.

The lcb statistic of a set partition. Let $S = B_1,\ldots,B_k$ be a set partition with ordered blocks $B_i$ and with $\operatorname{min} B_a < \operatorname{min} B_b$ for $a < b$. According to [1, Definition 3], a '''lcb''' (left-closer-bigger) of $S$ is given by a pair $i < j$ such that $j = \operatorname{max} B_b$ and $i \in B_a$ for $a > b$.

The number of even inversions of a permutation. An inversion $i < j$ of a permutation is even if $i \equiv j~(\operatorname{mod} 2)$. See [[St000539]] for odd inversions.

The number of parabolic double cosets with minimal element being the given permutation. For $w \in S_n$, this is $$\big| W_I \tau W_J\ :\ \tau \in S_n,\ I,J \subseteq S,\ w = \min\{W_I \tau W_J\}\big|$$ where $S$ is the set of simple transpositions, $W_K$ is the parabolic subgroup generated by $K \subseteq S$, and $\min\{W_I \tau W_J\}$ is the unique minimal element in weak order in the double coset $W_I \tau W_J$. [1] contains a combinatorial description of these parabolic double cosets which can be used to compute this statistic.

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

The dimension exponent of a set partition. This is $$\sum_{B\in\pi} (\max(B) - \min(B) + 1) - n$$ where the summation runs over the blocks of the set partition $\pi$ of $\{1,\dots,n\}$. It is thus equal to the difference [[St000728]] - [[St000211]]. This is also the number of occurrences of the pattern {{1, 3}, {2}}, such that 1 and 3 are consecutive elements in a block. This is also the number of occurrences of the pattern {{1, 3}, {2}}, such that 1 is the minimal and 3 is the maximal element of the block.