The number of rises of length at least 3 of a Dyck path. The number of Dyck paths without such rises are counted by the Motzkin numbers [1].

The number of cut vertices of a graph. A cut vertex is one whose deletion increases the number of connected components.

Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path.

The cardinality of a minimal cycle-isolating set of a graph. Let $\mathcal F$ be a set of graphs. A set of vertices $S$ is $\mathcal F$-isolating, if the subgraph induced by the vertices in the complement of the closed neighbourhood of $S$ does not contain any graph in $\mathcal F$. This statistic returns the cardinality of the smallest isolating set when $\mathcal F$ contains all cycles.

The number of celebrities in a graph. A celebrity is a vertex such that more than half of its neighbours have smaller degree.

The number of excedances of a set partition. The Mahonian representation of a set partition $\{B_1,\dots,B_k\}$ of $\{1,\dots,n\}$ is the restricted growth word $w_1 \dots w_n$ obtained by sorting the blocks of the set partition according to their maximal element, and setting $w_i$ to the index of the block containing $i$. Let $\bar w$ be the nondecreasing rearrangement of $w$. The word $w$ has an excedance at position $i$ if $w_i > \bar w_i$.

The number of descents of a set partition. The Mahonian representation of a set partition $\{B_1,\dots,B_k\}$ of $\{1,\dots,n\}$ is the restricted growth word $w_1\dots w_n\}$ obtained by sorting the blocks of the set partition according to their maximal element, and setting $w_i$ to the index of the block containing $i$. The word $w$ has a descent at position $i$ if $w_i > w_{i+1}$.

The number of exclusive right-to-left minima of a permutation. This is the number of right-to-left minima that are not left-to-right maxima. This is also the number of non weak exceedences of a permutation that are also not mid-points of a decreasing subsequence of length 3. Given a permutation $\pi = [\pi_1,\ldots,\pi_n]$, this statistic counts the number of position $j$ such that $\pi_j < j$ and there do not exist indices $i,k$ with $i < j < k$ and $\pi_i > \pi_j > \pi_k$. See also [[St000213]] and [[St000119]].

The reversal length of a permutation. A reversal in a permutation $\pi = [\pi_1,\ldots,\pi_n]$ is a reversal of a subsequence of the form $\operatorname{reversal}_{i,j}(\pi) = [\pi_1,\ldots,\pi_{i-1},\pi_j,\pi_{j-1},\ldots,\pi_{i+1},\pi_i,\pi_{j+1},\ldots,\pi_n]$ for $1 \leq i < j \leq n$. This statistic is then given by the minimal number of reversals needed to sort a permutation. The reversal distance between two permutations plays an important role in studying DNA structures.