The number of standard desarrangement tableaux of shape equal to the given partition. A '''standard desarrangement tableau''' is a standard tableau whose first ascent is even. Here, an ascent of a standard tableau is an entry $i$ such that $i+1$ appears to the right or above $i$ in the tableau (with respect to English tableau notation). This is also the nullity of the random-to-random operator (and the random-to-top) operator acting on the simple module of the symmetric group indexed by the given partition. See also: * [[St000046]]: The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition * [[St000500]]: Eigenvalues of the random-to-random operator acting on the regular representation.

The number of rises of length 3 of a Dyck path.

The number of semistandard Young tableau of given shape, with entries at most 2. This is also the dimension of the corresponding irreducible representation of $GL_2$.

The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. The Kronecker coefficient is the multiplicity $g_{\mu,\nu}^\lambda$ of the Specht module $S^\lambda$ in $S^\mu\otimes S^\nu$: $$ S^\mu\otimes S^\nu = \bigoplus_\lambda g_{\mu,\nu}^\lambda S^\lambda $$ This statistic records the Kronecker coefficient $g_{\lambda,\lambda}^{21^{n-2}}$, for $\lambda\vdash n$.

The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition.

The number of 2-regular simple modules in the incidence algebra of the lattice.

The number of preimages of an integer partition in Bulgarian solitaire. A move in Bulgarian solitaire consists of removing the first column of the Ferrers diagram and inserting it as a new row. Partitions without preimages are called garden of eden partitions [1].

The Dyson rank of a partition. This rank is defined as the largest part minus the number of parts. It was introduced by Dyson [1] in connection to Ramanujan's partition congruences $$p(5n+4) \equiv 0 \pmod 5$$ and $$p(7n+6) \equiv 0 \pmod 7.$$

The Andrews-Garvan crank of a partition. If $\pi$ is a partition, let $l(\pi)$ be its length (number of parts), $\omega(\pi)$ be the number of parts equal to 1, and $\mu(\pi)$ be the number of parts larger than $\omega(\pi)$. The crank is then defined by $$ c(\pi) = \begin{cases} l(\pi) &\text{if \(\omega(\pi)=0\)}\\ \mu(\pi) - \omega(\pi) &\text{otherwise}. \end{cases} $$ This statistic was defined in [1] to explain Ramanujan's partition congruence $$p(11n+6) \equiv 0 \pmod{11}$$ in the same way as the Dyson rank ([[St000145]]) explains the congruences $$p(5n+4) \equiv 0 \pmod{5}$$ and $$p(7n+5) \equiv 0 \pmod{7}.$$

Dyson's crank of a partition. Let $\lambda$ be a partition and let $o(\lambda)$ be the number of parts that are equal to 1 ([[St000475]]), and let $\mu(\lambda)$ be the number of parts that are strictly larger than $o(\lambda)$ ([[St000473]]). Dyson's crank is then defined as $$crank(\lambda) = \begin{cases} \text{ largest part of }\lambda & o(\lambda) = 0\\ \mu(\lambda) - o(\lambda) & o(\lambda) > 0. \end{cases}$$