The number of very big ascents of a permutation. A very big ascent of a permutation $\pi$ is an index $i$ such that $\pi_{i+1} - \pi_i > 2$. For the number of ascents, see [[St000245]] and for the number of big ascents, see [[St000646]]. General $r$-ascents were for example be studied in [1, Section 2].

The number of big descents of a permutation. For a permutation $\pi$, this is the number of indices $i$ such that $\pi(i)-\pi(i+1) > 1$. The generating functions of big descents is equal to the generating function of (normal) descents after sending a permutation from cycle to one-line notation [[Mp00090]], see [Theorem 2.5, 1]. For the number of small descents, see [[St000214]].

The number of non weak exceedences of a permutation that are 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 exist indices $i,k$ with $i < j < k$ and $\pi_i > \pi_j > \pi_k$. See also [[St000213]] and [[St000119]].

The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation.

The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation.

The number of exceedances (also excedences) of a permutation. This is defined as $exc(\sigma) = \#\{ i : \sigma(i) > i \}$. It is known that the number of exceedances is equidistributed with the number of descents, and that the bistatistic $(exc,den)$ is [[Permutations/Descents-Major#Euler-Mahonian_statistics|Euler-Mahonian]]. Here, $den$ is the Denert index of a permutation, see [[St000156]].

The number of internal nodes of a binary tree. That is, the total number of nodes of the tree minus [[St000203]]. A counting formula for the total number of internal nodes across all binary trees of size $n$ is given in [1]. This is equivalent to the number of internal triangles in all triangulations of an $(n+1)$-gon.

The number of exclusive left-to-right maxima of a permutation. This is the number of left-to-right maxima that are not right-to-left minima.

The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation.

The number of occurrences of the arrow pattern 1-2 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$.