searching the database
Your data matches 472 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St000363
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Values
([],1)
=> 1 = 0 + 1
([],2)
=> 1 = 0 + 1
([(0,1)],2)
=> 2 = 1 + 1
([],3)
=> 1 = 0 + 1
([(1,2)],3)
=> 2 = 1 + 1
([(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,1),(0,2),(1,2)],3)
=> 3 = 2 + 1
([],4)
=> 1 = 0 + 1
([(2,3)],4)
=> 2 = 1 + 1
([(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(1,2)],4)
=> 4 = 3 + 1
([(0,3),(1,2),(2,3)],4)
=> 3 = 2 + 1
([(1,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2 = 1 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4 = 3 + 1
Description
The number of minimal vertex covers of a graph.
A '''vertex cover''' of a graph $G$ is a subset $S$ of the vertices of $G$ such that each edge of $G$ contains at least one vertex of $S$. A vertex cover is minimal if it contains the least possible number of vertices.
This is also the leading coefficient of the clique polynomial of the complement of $G$.
This is also the number of independent sets of maximal cardinality of $G$.
Matching statistic: St001119
Values
([],1)
=> ([],1)
=> 0
([],2)
=> ([],1)
=> 0
([(0,1)],2)
=> ([(0,1)],2)
=> 1
([],3)
=> ([],1)
=> 0
([(1,2)],3)
=> ([(1,2)],3)
=> 0
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([],4)
=> ([],1)
=> 0
([(2,3)],4)
=> ([(1,2)],3)
=> 0
([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
Description
The length of a shortest maximal path in a graph.
Matching statistic: St000160
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00251: Graphs —clique sizes⟶ Integer partitions
St000160: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000160: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> 1 = 0 + 1
([],2)
=> [1,1]
=> 2 = 1 + 1
([(0,1)],2)
=> [2]
=> 1 = 0 + 1
([],3)
=> [1,1,1]
=> 3 = 2 + 1
([(1,2)],3)
=> [2,1]
=> 1 = 0 + 1
([(0,2),(1,2)],3)
=> [2,2]
=> 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> 1 = 0 + 1
([],4)
=> [1,1,1,1]
=> 4 = 3 + 1
([(2,3)],4)
=> [2,1,1]
=> 2 = 1 + 1
([(1,3),(2,3)],4)
=> [2,2,1]
=> 1 = 0 + 1
([(0,3),(1,3),(2,3)],4)
=> [2,2,2]
=> 3 = 2 + 1
([(0,3),(1,2)],4)
=> [2,2]
=> 2 = 1 + 1
([(0,3),(1,2),(2,3)],4)
=> [2,2,2]
=> 3 = 2 + 1
([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,2]
=> 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2,2,2]
=> 4 = 3 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [3,3]
=> 2 = 1 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1 = 0 + 1
Description
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].
Matching statistic: St001373
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 1 = 0 + 1
([],2)
=> ([],2)
=> 2 = 1 + 1
([(0,1)],2)
=> ([],1)
=> 1 = 0 + 1
([],3)
=> ([],3)
=> 3 = 2 + 1
([(1,2)],3)
=> ([],2)
=> 2 = 1 + 1
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1 = 0 + 1
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 1 = 0 + 1
([],4)
=> ([],4)
=> 4 = 3 + 1
([(2,3)],4)
=> ([],3)
=> 3 = 2 + 1
([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 2 = 1 + 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,3),(1,2)],4)
=> ([],2)
=> 2 = 1 + 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> 2 = 1 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 4 = 3 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 1 = 0 + 1
Description
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.
Matching statistic: St001463
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 1 = 0 + 1
([],2)
=> ([],2)
=> 2 = 1 + 1
([(0,1)],2)
=> ([],1)
=> 1 = 0 + 1
([],3)
=> ([],3)
=> 3 = 2 + 1
([(1,2)],3)
=> ([],2)
=> 2 = 1 + 1
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1 = 0 + 1
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 1 = 0 + 1
([],4)
=> ([],4)
=> 4 = 3 + 1
([(2,3)],4)
=> ([],3)
=> 3 = 2 + 1
([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 2 = 1 + 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,3),(1,2)],4)
=> ([],2)
=> 2 = 1 + 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> 2 = 1 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 4 = 3 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 1 = 0 + 1
Description
The number of distinct columns in the nullspace of a graph.
Let $A$ be the adjacency matrix of a graph on $n$ vertices, and $K$ a $n\times d$ matrix whose column vectors form a basis of the nullspace of $A$. Then any other matrix $K'$ whose column vectors also form a basis of the nullspace is related to $K$ by $K' = K T$ for some invertible $d\times d$ matrix $T$. Any two rows of $K$ are equal if and only if they are equal in $K'$.
The nullspace of a graph is usually written as a $d\times n$ matrix, hence the name of this statistic.
Matching statistic: St000261
Values
([],1)
=> ([],1)
=> ([],1)
=> 0
([],2)
=> ([],1)
=> ([],1)
=> 0
([(0,1)],2)
=> ([],2)
=> ([(0,1)],2)
=> 1
([],3)
=> ([],1)
=> ([],1)
=> 0
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 0
([(0,2),(1,2)],3)
=> ([],2)
=> ([(0,1)],2)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([],4)
=> ([],1)
=> ([],1)
=> 0
([(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 0
([(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([],2)
=> ([(0,1)],2)
=> 1
([(0,3),(1,2)],4)
=> ([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([],2)
=> ([(0,1)],2)
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
Description
The edge connectivity of a graph.
This is the minimum number of edges that has to be removed to make the graph disconnected.
Matching statistic: St000262
Values
([],1)
=> ([],1)
=> ([],1)
=> 0
([],2)
=> ([],1)
=> ([],1)
=> 0
([(0,1)],2)
=> ([],2)
=> ([(0,1)],2)
=> 1
([],3)
=> ([],1)
=> ([],1)
=> 0
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 0
([(0,2),(1,2)],3)
=> ([],2)
=> ([(0,1)],2)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([],4)
=> ([],1)
=> ([],1)
=> 0
([(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 0
([(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([],2)
=> ([(0,1)],2)
=> 1
([(0,3),(1,2)],4)
=> ([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([],2)
=> ([(0,1)],2)
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
Description
The vertex connectivity of a graph.
For non-complete graphs, this is the minimum number of vertices that has to be removed to make the graph disconnected.
Matching statistic: St000295
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00251: Graphs —clique sizes⟶ Integer partitions
Mp00317: Integer partitions —odd parts⟶ Binary words
St000295: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00317: Integer partitions —odd parts⟶ Binary words
St000295: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> 1 => 0
([],2)
=> [1,1]
=> 11 => 1
([(0,1)],2)
=> [2]
=> 0 => 0
([],3)
=> [1,1,1]
=> 111 => 2
([(1,2)],3)
=> [2,1]
=> 01 => 0
([(0,2),(1,2)],3)
=> [2,2]
=> 00 => 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> 1 => 0
([],4)
=> [1,1,1,1]
=> 1111 => 3
([(2,3)],4)
=> [2,1,1]
=> 011 => 0
([(1,3),(2,3)],4)
=> [2,2,1]
=> 001 => 0
([(0,3),(1,3),(2,3)],4)
=> [2,2,2]
=> 000 => 2
([(0,3),(1,2)],4)
=> [2,2]
=> 00 => 1
([(0,3),(1,2),(2,3)],4)
=> [2,2,2]
=> 000 => 2
([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> 11 => 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,2]
=> 10 => 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2,2,2]
=> 0000 => 3
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [3,3]
=> 11 => 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 0 => 0
Description
The length of the border of a binary word.
The border of a word is the longest word which is both a proper prefix and a proper suffix, including a possible empty border.
Matching statistic: St000310
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> 0
([],2)
=> ([],1)
=> ([],1)
=> 0
([(0,1)],2)
=> ([],2)
=> ([(0,1)],2)
=> 1
([],3)
=> ([],1)
=> ([],1)
=> 0
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 0
([(0,2),(1,2)],3)
=> ([],2)
=> ([(0,1)],2)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([],4)
=> ([],1)
=> ([],1)
=> 0
([(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 0
([(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([],2)
=> ([(0,1)],2)
=> 1
([(0,3),(1,2)],4)
=> ([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([],2)
=> ([(0,1)],2)
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
Description
The minimal degree of a vertex of a graph.
Matching statistic: St000987
Values
([],1)
=> ([],1)
=> ([],1)
=> 0
([],2)
=> ([],2)
=> ([(0,1)],2)
=> 1
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 0
([],3)
=> ([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([(1,2)],3)
=> ([],2)
=> ([(0,1)],2)
=> 1
([(0,2),(1,2)],3)
=> ([],1)
=> ([],1)
=> 0
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([],4)
=> ([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(2,3)],4)
=> ([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([(1,3),(2,3)],4)
=> ([],2)
=> ([(0,1)],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(1,2)],4)
=> ([],2)
=> ([(0,1)],2)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
Description
The number of positive eigenvalues of the Laplacian matrix of the graph.
This is the number of vertices minus the number of connected components of the graph.
The following 462 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001357The maximal degree of a regular spanning subgraph of a graph. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St000297The number of leading ones in a binary word. St000627The exponent of a binary word. St000722The number of different neighbourhoods in a graph. St000733The row containing the largest entry of a standard tableau. St000993The multiplicity of the largest part of an integer partition. St001316The domatic number of a graph. St001725The harmonious chromatic number of a graph. St001884The number of borders of a binary word. St000008The major index of the composition. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001107The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001274The number of indecomposable injective modules with projective dimension equal to two. St000392The length of the longest run of ones in a binary word. St000617The number of global maxima of a Dyck path. St000765The number of weak records in an integer composition. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001389The number of partitions of the same length below the given integer partition. St001481The minimal height of a peak of a Dyck path. St001733The number of weak left to right maxima of a Dyck path. St000326The position of the first one in a binary word after appending a 1 at the end. St000969We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n-1}]$ by adding $c_0$ to $c_{n-1}$. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001814The number of partitions interlacing the given partition. St000932The number of occurrences of the pattern UDU in a Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001613The binary logarithm of the size of the center of a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St001615The number of join prime elements of a lattice. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001638The book thickness of a graph. St001657The number of twos in an integer partition. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001584The area statistic between a Dyck path and its bounce path. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001961The sum of the greatest common divisors of all pairs of parts. St001645The pebbling number of a connected graph. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001570The minimal number of edges to add to make a graph Hamiltonian. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St000454The largest eigenvalue of a graph if it is integral. St000741The Colin de Verdière graph invariant. St000478Another weight of a partition according to Alladi. St000941The number of characters of the symmetric group whose value on the partition is even. St001592The maximal number of simple paths between any two different vertices of a graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St000379The number of Hamiltonian cycles in a graph. St000680The Grundy value for Hackendot on posets. St000940The number of characters of the symmetric group whose value on the partition is zero. St000944The 3-degree of an integer partition. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St001056The Grundy value for the game of deleting vertices of a graph until it has no edges. St001176The size of a partition minus its first part. St001498The normalised height of a Nakayama algebra with magnitude 1. St001587Half of the largest even part of an integer partition. St001668The number of points of the poset minus the width of the poset. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St000421The number of Dyck paths that are weakly below a Dyck path, except for the path itself. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000938The number of zeros of the symmetric group character corresponding to the partition. St000984The number of boxes below precisely one peak. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001480The number of simple summands of the module J^2/J^3. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001330The hat guessing number of a graph. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000674The number of hills of a Dyck path. St000874The position of the last double rise in a Dyck path. St000946The sum of the skew hook positions in a Dyck path. St000947The major index east count of a Dyck path. St000976The sum of the positions of double up-steps of a Dyck path. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001621The number of atoms of a lattice. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St000137The Grundy value of an integer partition. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000460The hook length of the last cell along the main diagonal of an integer partition. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000699The toughness times the least common multiple of 1,. St000870The product of the hook lengths of the diagonal cells in an integer partition. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001248Sum of the even parts of a partition. St001249Sum of the odd parts of a partition. St001279The sum of the parts of an integer partition that are at least two. St001280The number of parts of an integer partition that are at least two. St001281The normalized isoperimetric number of a graph. St001360The number of covering relations in Young's lattice below a partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001383The BG-rank of an integer partition. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001525The number of symmetric hooks on the diagonal of a partition. St001541The Gini index of an integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001600The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001637The number of (upper) dissectors of a poset. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001933The largest multiplicity of a part in an integer partition. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000010The length of the partition. St000012The area of a Dyck path. St000016The number of attacking pairs of a standard tableau. St000026The position of the first return of a Dyck path. St000032The number of elements smaller than the given Dyck path in the Tamari Order. St000053The number of valleys of the Dyck path. St000063The number of linear extensions of a certain poset defined for an integer partition. St000088The row sums of the character table of the symmetric group. St000108The number of partitions contained in the given partition. St000117The number of centered tunnels of a Dyck path. St000120The number of left tunnels of a Dyck path. St000142The number of even parts of a partition. St000143The largest repeated part of a partition. St000147The largest part of an integer partition. St000148The number of odd parts of a partition. St000149The number of cells of the partition whose leg is zero and arm is odd. St000150The floored half-sum of the multiplicities of a partition. St000159The number of distinct parts of the integer partition. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000179The product of the hook lengths of the integer partition. St000183The side length of the Durfee square of an integer partition. St000185The weighted size of a partition. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000225Difference between largest and smallest parts in a partition. St000228The size of a partition. St000256The number of parts from which one can substract 2 and still get an integer partition. St000257The number of distinct parts of a partition that occur at least twice. St000288The number of ones in a binary word. St000290The major index of a binary word. St000293The number of inversions of a binary word. St000296The length of the symmetric border of a binary word. St000306The bounce count of a Dyck path. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000321The number of integer partitions of n that are dominated by an integer partition. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000331The number of upper interactions of a Dyck path. St000335The difference of lower and upper interactions. St000340The number of non-final maximal constant sub-paths of length greater than one. St000345The number of refinements of a partition. St000346The number of coarsenings of a partition. St000369The dinv deficit of a Dyck path. St000376The bounce deficit of a Dyck path. St000377The dinv defect of an integer partition. St000378The diagonal inversion number of an integer partition. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000384The maximal part of the shifted composition of an integer partition. St000389The number of runs of ones of odd length in a binary word. St000393The number of strictly increasing runs in a binary word. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000442The maximal area to the right of an up step of a Dyck path. St000443The number of long tunnels of a Dyck path. St000444The length of the maximal rise of a Dyck path. St000459The hook length of the base cell of a partition. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000475The number of parts equal to 1 in a partition. St000480The number of lower covers of a partition in dominance order. St000481The number of upper covers of a partition in dominance order. St000513The number of invariant subsets of size 2 when acting with a permutation of given cycle type. St000519The largest length of a factor maximising the subword complexity. St000531The leading coefficient of the rook polynomial of an integer partition. St000532The total number of rook placements on a Ferrers board. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000547The number of even non-empty partial sums of an integer partition. St000548The number of different non-empty partial sums of an integer partition. St000549The number of odd partial sums of an integer partition. St000567The sum of the products of all pairs of parts. St000644The number of graphs with given frequency partition. St000658The number of rises of length 2 of a Dyck path. St000659The number of rises of length at least 2 of a Dyck path. St000661The number of rises of length 3 of a Dyck path. St000667The greatest common divisor of the parts of the partition. St000683The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000697The number of 3-rim hooks removed from an integer partition to obtain its associated 3-core. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000738The first entry in the last row of a standard tableau. St000749The 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. St000753The Grundy value for the game of Kayles on a binary word. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000759The smallest missing part in an integer partition. St000783The side length of the largest staircase partition fitting into a partition. St000784The maximum of the length and the largest part of the integer partition. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000811The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to Schur symmetric functions. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000867The sum of the hook lengths in the first row of an integer partition. St000869The sum of the hook lengths of an integer partition. St000876The number of factors in the Catalan decomposition of a binary word. St000877The depth of the binary word interpreted as a path. St000885The number of critical steps in the Catalan decomposition of a binary word. St000897The number of different multiplicities of parts of an integer partition. St000921The number of internal inversions of a binary word. St000922The minimal number such that all substrings of this length are unique. St000931The number of occurrences of the pattern UUU in a Dyck path. St000934The 2-degree of an integer partition. St000935The number of ordered refinements of an integer partition. St000952Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St000982The length of the longest constant subword. St000992The alternating sum of the parts of an integer partition. St000995The largest even part of an integer partition. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001010Number of indecomposable injective modules with projective dimension g-1 when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. St001015Number of indecomposable injective modules with codominant dimension equal to one in the Nakayama algebra corresponding to the Dyck path. St001016Number of indecomposable injective modules with codominant dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001020Sum of the codominant dimensions of the non-projective indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001027Number of simple modules with projective dimension equal to injective dimension in the Nakayama algebra corresponding to the Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St001055The Grundy value for the game of removing cells of a row in an integer partition. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001091The number of parts in an integer partition whose next smaller part has the same size. St001092The number of distinct even parts of a partition. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001121The multiplicity of the irreducible representation indexed by the partition in the Kronecker square corresponding to the partition. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. St001127The sum of the squares of the parts of a partition. St001139The number of occurrences of hills of size 2 in a Dyck path. St001141The number of occurrences of hills of size 3 in a Dyck path. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001161The major index north count of a Dyck path. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001172The number of 1-rises at odd height of a Dyck path. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001193The dimension of $Ext_A^1(A/AeA,A)$ in the corresponding Nakayama algebra $A$ such that $eA$ is a minimal faithful projective-injective module. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001214The aft of an integer partition. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001252Half the sum of the even parts of a partition. St001267The length of the Lyndon factorization of the binary word. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001275The projective dimension of the second term in a minimal injective coresolution of the regular module. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001297The number of indecomposable non-injective projective modules minus the number of indecomposable non-injective projective modules that have reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001348The bounce of the parallelogram polyomino associated with the Dyck path. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001371The length of the longest Yamanouchi prefix of a binary word. St001372The length of a longest cyclic run of ones of a binary word. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001387Number of standard Young tableaux of the skew shape tracing the border of the given partition. St001400The total number of Littlewood-Richardson tableaux of given shape. St001413Half the length of the longest even length palindromic prefix of a binary word. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001415The length of the longest palindromic prefix of a binary word. St001416The length of a longest palindromic factor of a binary word. St001417The length of a longest palindromic subword of a binary word. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001423The number of distinct cubes in a binary word. St001424The number of distinct squares in a binary word. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001437The flex of a binary word. St001484The number of singletons of an integer partition. St001485The modular major index of a binary word. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001523The degree of symmetry of a Dyck path. St001524The degree of symmetry of a binary word. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001527The cyclic permutation representation number of an integer partition. St001571The Cartan determinant of the integer partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001588The number of distinct odd parts smaller than the largest even part in an integer partition. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001651The Frankl number of a lattice. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. St001660The number of ways to place as many non-attacking rooks as possible on a skew Ferrers board. St001697The shifted natural comajor index of a standard Young tableau. St001721The degree of a binary word. St001730The number of times the path corresponding to a binary word crosses the base line. St001732The number of peaks visible from the left. St001809The index of the step at the first peak of maximal height in a Dyck path. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between $e_i J$ and $e_j J$ (the radical of the indecomposable projective modules). St001910The height of the middle non-run of a Dyck path. St001930The weak major index of a binary word. St001932The number of pairs of singleton blocks in the noncrossing set partition corresponding to a Dyck path, that can be merged to create another noncrossing set partition. St001955The number of natural descents for set-valued two row standard Young tableaux. St001956The comajor index for set-valued two-row standard Young tableaux. St001959The product of the heights of the peaks of a Dyck path. St001118The acyclic chromatic index of a graph. St000929The constant term of the character polynomial of an integer partition. St001644The dimension of a graph. St001816Eigenvalues of the top-to-random operator acting on a simple module. St000456The monochromatic index of a connected graph. St000046The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition. St001262The dimension of the maximal parabolic seaweed algebra corresponding to the partition. St001378The product of the cohook lengths of the integer partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001564The value of the forgotten symmetric functions when all variables set to 1. St001607The number of coloured graphs such that the multiplicities of colours are given by a partition. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St000145The Dyson rank of a partition. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001561The value of the elementary symmetric function evaluated at 1. St001602The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on endofunctions. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001610The number of coloured endofunctions such that the multiplicities of colours are given by a partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St000455The second largest eigenvalue of a graph if it is integral. St000936The number of even values of the symmetric group character corresponding to the partition. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001098The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for vertex labelled trees. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000928The sum of the coefficients of the character polynomial of an integer partition. St001060The distinguishing index of a graph. St001175The size of a partition minus the hook length of the base cell. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St000422The energy of a graph, if it is integral. St001545The second Elser number of a connected graph. St000284The Plancherel distribution on integer partitions. St000302The determinant of the distance matrix of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St000467The hyper-Wiener index of a connected graph. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000668The least common multiple of the parts of the partition. St000681The Grundy value of Chomp on Ferrers diagrams. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St000815The number of semistandard Young tableaux of partition weight of given shape. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000933The number of multipartitions of sizes given by an integer partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St001128The exponens consonantiae of a partition. St001568The smallest positive integer that does not appear twice in the partition. St001845The number of join irreducibles minus the rank of a lattice. St001877Number of indecomposable injective modules with projective dimension 2. St001617The dimension of the space of valuations of a lattice. St000420The number of Dyck paths that are weakly above a Dyck path. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000675The number of centered multitunnels of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St000693The modular (standard) major index of a standard tableau. St000706The product of the factorials of the multiplicities of an integer partition. St000735The last entry on the main diagonal of a standard tableau. St000744The length of the path to the largest entry in a standard Young tableau. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001500The global dimension of magnitude 1 Nakayama algebras. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001808The box weight or horizontal decoration of a Dyck path. St001626The number of maximal proper sublattices of a lattice. St000618The number of self-evacuating tableaux of given shape. St000781The number of proper colouring schemes of a Ferrers diagram. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001432The order dimension of the partition. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001763The Hurwitz number of an integer partition. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001924The number of cells in an integer partition whose arm and leg length coincide. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001938The number of transitive monotone factorizations of genus zero of a permutation of given cycle type.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!