The minimal size of a base for the Weyl group of the Cartan type. A base of a permutation group is a set $B$ such that the pointwise stabilizer of $B$ is trivial. For example, a base of the symmetric group on $n$ letters must contain all but one letter. Any base has at least $\log |G|/n$ elements, where $n$ is the degree of the group, i.e., the size of its domain.

The number of parts of a partition that are not congruent 0 modulo 3.

The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. Assign to each cell of the Ferrers diagram an arrow pointing north, east, south or west. Then compute for each cell the number of arrows pointing towards it, and take the minimum of those. This statistic is the maximal minimum that can be obtained by assigning arrows in any way.

The multiplicity of the smallest part of a partition. This counts the number of occurrences of the smallest part $spt(\lambda)$ of a partition $\lambda$. The sum $spt(n) = \sum_{\lambda \vdash n} spt(\lambda)$ satisfies the congruences \begin{align*} spt(5n+4) &\equiv 0\quad \pmod{5}\\\ spt(7n+5) &\equiv 0\quad \pmod{7}\\\ spt(13n+6) &\equiv 0\quad \pmod{13}, \end{align*} analogous to those of the counting function of partitions, see [1] and [2].

The largest multiplicity of a part in an integer partition.

The number of parts of a partition that are not congruent 1 modulo 3.

The degree of symmetry of a binary word. For a binary word $w$ of length $n$, this is the number of positions $i\leq n/2$ such that $w_i = w_{n+1-i}$.

The number of distinct parts of a partition that occur at least twice. See Section 3.3.1 of [2].

The (zero)-forcing number of a graph. This is the minimal number of vertices initially coloured black, such that eventually all vertices of the graph are coloured black when using the following rule: when $u$ is a black vertex of $G$, and exactly one neighbour $v$ of $u$ is white, then colour $v$ black.

The maximal multiplicity of an eigenvalue in a graph.