The symmetric bilinear form applied to the highest root and the Weyl vector of a finite Cartan type. The Weyl vector is half the sum of the positive roots, or the sum of the fundamental weights.

The dimension of the representation $V(\Lambda_1)$. The sizes of $E_6$ and $E_7$ can be seen in [1].

The number of conjugacy classes in the Weyl group of a finite Cartan type.

The degree of the largest fundamental representation associated with a Cartan type.

The number of zeros in the character table of the Weyl group of a Cartan type.

Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. Given $\lambda$ count how many ''integer partitions'' $w$ (weight) there are, such that $P_{\lambda,w}$ is integral, i.e., $w$ such that the Gelfand-Tsetlin polytope $P_{\lambda,w}$ has only integer lattice points as vertices. See also [[St000205]], [[St000206]] and [[St000207]].

The cardinality of the automorphism group of a graph.

The number of integer partitions of n that are dominated by an integer partition. A partition $\lambda = (\lambda_1,\ldots,\lambda_n) \vdash n$ dominates a partition $\mu = (\mu_1,\ldots,\mu_n) \vdash n$ if $\sum_{i=1}^k (\lambda_i - \mu_i) \geq 0$ for all $k$.

The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. To be precise, this is given for a partition $\lambda \vdash n$ by the number of standard tableaux $T$ of shape $\lambda$ such that $\min\big( \operatorname{Des}(T) \cup \{n\} \big)$ is even. This notion was used in [1, Proposition 2.3], see also [2, Theorem 1.1]. The case of an odd minimum is [[St000620]].

The number of coloured trees such that the multiplicities of colours are given by a partition. In particular, the value on the partition $(n)$ is the number of unlabelled trees on $n$ vertices, [[oeis:A000055]], whereas the value on the partition $(1^n)$ is the number of labelled trees [[oeis:A000272]].