The least common multiple of the parts of the partition.

The length of the longest pattern of the form k 1 2...(k-1).

The length of the initial strictly increasing segment of a parking function.

The number of occurrences of a type-B 231 pattern in a signed permutation. For a signed permutation $\pi\in\mathfrak H_n$, a triple $-n \leq i < j < k\leq n$ is an occurrence of the type-B $231$ pattern, if $1 \leq j < k$, $\pi(i) < \pi(j)$ and $\pi(i)$ is one larger than $\pi(k)$, i.e., $\pi(i) = \pi(k) + 1$ if $\pi(k) \neq -1$ and $\pi(i) = 1$ otherwise.

The number of edges in the reduced word graph of a signed permutation. The reduced word graph of a signed permutation $\pi$ has the reduced words of $\pi$ as vertices and an edge between two reduced words if they differ by exactly one braid move.

Sparre Andersen's position of the maximum of a signed permutation. For $\pi$ a signed permutation of length $n$, first create the tuple $x = (x_1, \dots, x_n)$, where $x_i = c_{|\pi_1|} \operatorname{sgn}(\pi_{|\pi_1|}) + \cdots + c_{|\pi_i|} \operatorname{sgn}(\pi_{|\pi_i|})$ and $(c_1, \dots ,c_n) = (1, 2, \dots, 2^{n-1})$. The actual value of the c-tuple for Andersen's statistic does not matter so long as no sums or differences of any subset of the $c_i$'s is zero. The choice of powers of $2$ is just a convenient choice. This returns the largest position of the maximum value in the $x$-tuple. This is related to the ''discrete arcsine distribution''. The number of signed permutations with value equal to $k$ is given by $\binom{2k}{k} \binom{2n-2k}{n-k} \frac{n!}{2^n}$. This statistic is equidistributed with Sparre Andersen's `Number of Positives' statistic.