Half of MacMahon's equal index of a Dyck path. This is half the sum of the positions of double (up- or down-)steps of a Dyck path, see [1, p. 135].

The major index of a Dyck path. This is the sum over all $i+j$ for which $(i,j)$ is a valley of $D$. The generating function of the major index yields '''MacMahon''' 's $q$-Catalan numbers $$\sum_{D \in \mathfrak{D}_n} q^{\operatorname{maj}(D)} = \frac{1}{[n+1]_q}\begin{bmatrix} 2n \\ n \end{bmatrix}_q,$$ where $[k]_q := 1+q+\ldots+q^{k-1}$ is the usual $q$-extension of the integer $k$, $[k]_q!:= [1]_q[2]_q \cdots [k]_q$ is the $q$-factorial of $k$ and $\left[\begin{smallmatrix} k \\ l \end{smallmatrix}\right]_q:=[k]_q!/[l]_q![k-l]_q!$ is the $q$-binomial coefficient. The major index was first studied by P.A.MacMahon in [1], where he proved this generating function identity. There is a bijection $\psi$ between Dyck paths and '''noncrossing permutations''' which simultaneously sends the area of a Dyck path [[St000012]] to the number of inversions [[St000018]], and the major index of the Dyck path to $n(n-1)$ minus the sum of the major index and the major index of the inverse [2]. For the major index on other collections, see [[St000004]] for permutations and [[St000290]] for binary words.

The sum of the major and the inverse major index of a permutation. This statistic is the sum of [[St000004]] and [[St000305]].

The natural major index of a standard Young tableau. A natural descent of a standard tableau $T$ is an entry $i$ such that $i+1$ appears in a higher row than $i$ in English notation. The natural major index of a tableau with natural descent set $D$ is then $\sum_{d\in D} d$.

The number of inversions plus the major index of a permutation. This is, the sum of [[St000004]] and [[St000018]].

The major index of a binary word. This is the sum of the positions of descents, i.e., a one followed by a zero. For words of length $n$ with $a$ zeros, the generating function for the major index is the $q$-binomial coefficient $\binom{n}{a}_q$.