Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. Associate to this special CNakayama algebra a Dyck path as follows: In the list L delete the first entry $c_0$ and substract from all other entries $n$−1 and then append the last element 1. The result is a Kupisch series of an LNakayama algebra. The statistic gives the $(t-1)/2$ when $t$ is the projective dimension of the simple module $S_{n-2}$.

The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1.

The index of the last row whose first entry is the row number in a standard Young tableau.

The number of small exceedances. This is the number of indices $i$ such that $\pi_i=i+1$.

The number of leading ones in a binary word.

The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra.

The position of the first one in a binary word after appending a 1 at the end. Regarding the binary word as a subset of $\{1,\dots,n,n+1\}$ that contains $n+1$, this is the minimal element of the set.

The first ascent of a permutation. For a permutation $\pi$, this is the smallest index such that $\pi(i) < \pi(i+1)$. For the first descent, see [[St000654]].

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

The Elizalde-Pak rank of a permutation. This is the largest $k$ such that $\pi(i) > k$ for all $i\leq k$. According to [1], the length of the longest increasing subsequence in a $321$-avoiding permutation is equidistributed with the rank of a $132$-avoiding permutation.