The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. For example, restricting $S_{(6,3)}$ to $\mathfrak S_8$ yields $$S_{(5,3)}\oplus S_{(6,2)}$$ of degrees (number of standard Young tableaux) 28 and 20, none of which are odd. Restricting to $\mathfrak S_7$ yields $$S_{(4,3)}\oplus 2S_{(5,2)}\oplus S_{(6,1)}$$ of degrees 14, 14 and 6. However, restricting to $\mathfrak S_6$ yields $$S_{(3,3)}\oplus 3S_{(4,2)}\oplus 3S_{(5,1)}\oplus S_6$$ of degrees 5,9,5 and 1. Therefore, the statistic on the partition $(6,3)$ gives 3. This is related to $2$-saturations of Welter's game, see [1, Corollary 1.2].

The second largest eigenvalue of a graph if it is integral. This statistic is undefined if the second largest eigenvalue of the graph is not integral. Chapter 4 of [1] provides lots of context.

The distinguishing index of a graph. This is the smallest number of colours such that there is a colouring of the edges which is not preserved by any automorphism. If the graph has a connected component which is a single edge, or at least two isolated vertices, this statistic is undefined.

The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. The distance Laplacian of a graph is the (symmetric) matrix with row and column sums $0$, which has the negative distances between two vertices as its off-diagonal entries. This statistic is the largest multiplicity of an eigenvalue. For example, the cycle on four vertices has distance Laplacian $$ \left(\begin{array}{rrrr} 4 & -1 & -2 & -1 \\ -1 & 4 & -1 & -2 \\ -2 & -1 & 4 & -1 \\ -1 & -2 & -1 & 4 \end{array}\right). $$ Its eigenvalues are $0,4,4,6$, so the statistic is $2$. The path on four vertices has eigenvalues $0, 4.7\dots, 6, 9.2\dots$ and therefore statistic $1$.

The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. The distance Laplacian of a graph is the (symmetric) matrix with row and column sums $0$, which has the negative distances between two vertices as its off-diagonal entries. This statistic is the largest multiplicity of an eigenvalue. For example, the cycle on four vertices has distance Laplacian $$ \left(\begin{array}{rrrr} 4 & -1 & -2 & -1 \\ -1 & 4 & -1 & -2 \\ -2 & -1 & 4 & -1 \\ -1 & -2 & -1 & 4 \end{array}\right). $$ Its eigenvalues are $0,4,4,6$, so the statistic is $1$. The path on four vertices has eigenvalues $0, 4.7\dots, 6, 9.2\dots$ and therefore also statistic $1$. The graphs with statistic $n-1$, $n-2$ and $n-3$ have been characterised, see [1].