The number of up-down runs of a permutation. An '''up-down run''' of a permutation $\pi=\pi_{1}\pi_{2}\cdots\pi_{n}$ is either a maximal monotone consecutive subsequence or $\pi_{1}$ if 1 is a descent of $\pi$. For example, the up-down runs of $\pi=85712643$ are $8$, $85$, $57$, $71$, $126$, and $643$.

The number of distinct Laplacian eigenvalues of a graph.

The number of non-final maximal constant sub-paths of length greater than one. This is the total number of occurrences of the patterns $110$ and $001$.

The number of changes of a binary word. This is the number of indices $i$ such that $w_i \neq w_{i+1}$.

The number of orbits of vertices of a graph under automorphisms.

The number of distinct eigenvalues of a graph.

The logarithm of the number of winning configurations of the lights out game on a graph. In the single player lamps out game, every vertex has two states, on or off. The player can toggle the state of a vertex, in which case all the neighbours of the vertex change state, too. The goal is to reach the configuration with all vertices off.

The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. The disjoint direct product decomposition of a permutation group factors the group corresponding to the product $(G, X) \ast (H, Y) = (G\times H, Z)$, where $Z$ is the disjoint union of $X$ and $Y$. In particular, for an asymmetric graph, i.e., with trivial automorphism group, this statistic equals the number of vertices, because the trivial action factors completely.

The number of distinct eigenvalues of the distance Laplacian of a connected graph.

The number of corners of the ribbon associated with an integer composition. We associate a ribbon shape to a composition $c=(c_1,\dots,c_n)$ with $c_i$ cells in the $i$-th row from bottom to top, such that the cells in two rows overlap in precisely one cell. This statistic records the total number of corners of the ribbon shape.