The number of subtrees.

The number of touch points (or returns) of a Dyck path. This is the number of points, excluding the origin, where the Dyck path has height 0.

The number of saliances of the permutation. A saliance is a right-to-left maximum. This can be described as an occurrence of the mesh pattern $([1], {(1,1)})$, i.e., the upper right quadrant is shaded, see [1].

The number of initial rises of a Dyck path. In other words, this is the height of the first peak of $D$.

The decomposition (or block) number of a permutation. For $\pi \in \mathcal{S}_n$, this is given by $$\#\big\{ 1 \leq k \leq n : \{\pi_1,\ldots,\pi_k\} = \{1,\ldots,k\} \big\}.$$ This is also known as the number of connected components [1] or the number of blocks [2] of the permutation, considering it as a direct sum. This is one plus [[St000234]].

The decomposition number of a perfect matching. This is the number of integers $i$ such that all elements in $\{1,\dots,i\}$ are matched among themselves. Visually, it is the number of components of the arc diagram of the matching, where a component is a matching of a set of consecutive numbers $\{a,a+1,\dots,b\}$ such that there is no arc matching a number smaller than $a$ with a number larger than $b$. E.g., $\{(1,6),(2,4),(3,5)\}$ is a hairpin under a single edge - crossing nested by a single arc. Thus, this matching has one component. However, $\{(1,2),(3,6),(4,5)\}$ is a single edge to the left of a ladder (a pair of nested edges), so it has two components.

The number of right-to-left minima of a permutation. For the number of left-to-right maxima, see [[St000314]].

Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra.

The number of topologically connected components of the chord diagram of a permutation. The chord diagram of a permutation $\pi\in\mathfrak S_n$ is obtained by placing labels $1,\dots,n$ in cyclic order on a cycle and drawing a (straight) arc from $i$ to $\pi(i)$ for every label $i$. This statistic records the number of topologically connected components in the chord diagram. In particular, if two arcs cross, all four labels connected by the two arcs are in the same component. The permutation $\pi\in\mathfrak S_n$ stabilizes an interval $I=\{a,a+1,\dots,b\}$ if $\pi(I)=I$. It is stabilized-interval-free, if the only interval $\pi$ stablizes is $\{1,\dots,n\}$. Thus, this statistic is $1$ if $\pi$ is stabilized-interval-free.

The number of global ascents of a permutation. The global ascents are the integers $i$ such that $$C(\pi)=\{i\in [n-1] \mid \forall 1 \leq j \leq i < k \leq n: \pi(j) < \pi(k)\}.$$ Equivalently, by the pigeonhole principle, $$C(\pi)=\{i\in [n-1] \mid \forall 1 \leq j \leq i: \pi(j) \leq i \}.$$ For $n > 1$ it can also be described as an occurrence of the mesh pattern $$([1,2], \{(0,2),(1,0),(1,1),(2,0),(2,1) \})$$ or equivalently $$([1,2], \{(0,1),(0,2),(1,1),(1,2),(2,0) \}),$$ see [3]. According to [2], this is also the cardinality of the connectivity set of a permutation. The permutation is connected, when the connectivity set is empty. This gives [[oeis:A003319]].