The position of the first down step of a Dyck path.

The first entry in the last row of a standard tableau. For the last entry in the first row, see [[St000734]].

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 first entry of the permutation. This can be described as 1 plus the number of occurrences of the vincular pattern ([2,1], {(0,0),(0,1),(0,2)}), i.e., the first column is shaded, see [1]. This statistic is related to the number of deficiencies [[St000703]] as follows: consider the arc diagram of a permutation $\pi$ of $n$, together with its rotations, obtained by conjugating with the long cycle $(1,\dots,n)$. Drawing the labels $1$ to $n$ in this order on a circle, and the arcs $(i, \pi(i))$ as straight lines, the rotation of $\pi$ is obtained by replacing each number $i$ by $(i\bmod n) +1$. Then, $\pi(1)-1$ is the number of rotations of $\pi$ where the arc $(1, \pi(1))$ is a deficiency. In particular, if $O(\pi)$ is the orbit of rotations of $\pi$, then the number of deficiencies of $\pi$ equals $$ \frac{1}{|O(\pi)|}\sum_{\sigma\in O(\pi)} (\sigma(1)-1). $$

The column of the unique '1' in the first row of the alternating sign matrix. The generating function of this statistic is given by $$\binom{n+k-2}{k-1}\frac{(2n-k-1)!}{(n-k)!}\;\prod_{j=0}^{n-2}\frac{(3j+1)!}{(n+j)!},$$ see [2].

The number of maximal elements of a poset.

The number of leading ones in a binary word.

The first part of an integer composition.

The smallest closer of a set partition. A closer (or right hand endpoint) of a set partition is a number that is maximal in its block. For this statistic, singletons are considered as closers. In other words, this is the smallest among the maximal elements of the blocks.

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].