searching the database
Your data matches 398 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 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Values
([],1)
=> 1
([],2)
=> 1
([(0,1)],2)
=> 2
([],3)
=> 1
([(1,2)],3)
=> 2
([(0,2),(1,2)],3)
=> 1
([(0,1),(0,2),(1,2)],3)
=> 3
([],4)
=> 1
([(2,3)],4)
=> 2
([(1,3),(2,3)],4)
=> 1
([(0,3),(1,3),(2,3)],4)
=> 1
([(0,3),(1,2)],4)
=> 4
([(0,3),(1,2),(2,3)],4)
=> 3
([(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
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: 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
([],2)
=> [1,1]
=> 2
([(0,1)],2)
=> [2]
=> 1
([],3)
=> [1,1,1]
=> 3
([(1,2)],3)
=> [2,1]
=> 1
([(0,2),(1,2)],3)
=> [2,2]
=> 2
([(0,1),(0,2),(1,2)],3)
=> [3]
=> 1
([],4)
=> [1,1,1,1]
=> 4
([(2,3)],4)
=> [2,1,1]
=> 2
([(1,3),(2,3)],4)
=> [2,2,1]
=> 1
([(0,3),(1,3),(2,3)],4)
=> [2,2,2]
=> 3
([(0,3),(1,2)],4)
=> [2,2]
=> 2
([(0,3),(1,2),(2,3)],4)
=> [2,2,2]
=> 3
([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,2]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2,2,2]
=> 4
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [3,3]
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 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
([],2)
=> ([],2)
=> 2
([(0,1)],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> 3
([(1,2)],3)
=> ([],2)
=> 2
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> 4
([(2,3)],4)
=> ([],3)
=> 3
([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 2
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> 2
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 4
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 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
([],2)
=> ([],2)
=> 2
([(0,1)],2)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> 3
([(1,2)],3)
=> ([],2)
=> 2
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> 4
([(2,3)],4)
=> ([],3)
=> 3
([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 2
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> 2
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 4
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 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: St001119
Values
([],1)
=> ([],1)
=> 0 = 1 - 1
([],2)
=> ([],1)
=> 0 = 1 - 1
([(0,1)],2)
=> ([(0,1)],2)
=> 1 = 2 - 1
([],3)
=> ([],1)
=> 0 = 1 - 1
([(1,2)],3)
=> ([(1,2)],3)
=> 0 = 1 - 1
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1 = 2 - 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
([],4)
=> ([],1)
=> 0 = 1 - 1
([(2,3)],4)
=> ([(1,2)],3)
=> 0 = 1 - 1
([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0 = 1 - 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 2 - 1
([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> 1 = 2 - 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 3 = 4 - 1
([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 0 = 1 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 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)
=> 3 = 4 - 1
Description
The length of a shortest maximal path in a graph.
Matching statistic: St000297
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00251: Graphs —clique sizes⟶ Integer partitions
Mp00095: Integer partitions —to binary word⟶ Binary words
St000297: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00095: Integer partitions —to binary word⟶ Binary words
St000297: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> 10 => 1
([],2)
=> [1,1]
=> 110 => 2
([(0,1)],2)
=> [2]
=> 100 => 1
([],3)
=> [1,1,1]
=> 1110 => 3
([(1,2)],3)
=> [2,1]
=> 1010 => 1
([(0,2),(1,2)],3)
=> [2,2]
=> 1100 => 2
([(0,1),(0,2),(1,2)],3)
=> [3]
=> 1000 => 1
([],4)
=> [1,1,1,1]
=> 11110 => 4
([(2,3)],4)
=> [2,1,1]
=> 10110 => 1
([(1,3),(2,3)],4)
=> [2,2,1]
=> 11010 => 2
([(0,3),(1,3),(2,3)],4)
=> [2,2,2]
=> 11100 => 3
([(0,3),(1,2)],4)
=> [2,2]
=> 1100 => 2
([(0,3),(1,2),(2,3)],4)
=> [2,2,2]
=> 11100 => 3
([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> 10010 => 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,2]
=> 10100 => 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2,2,2]
=> 111100 => 4
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [3,3]
=> 11000 => 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 10000 => 1
Description
The number of leading ones in a binary word.
Matching statistic: St000627
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00251: Graphs —clique sizes⟶ Integer partitions
Mp00317: Integer partitions —odd parts⟶ Binary words
St000627: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00317: Integer partitions —odd parts⟶ Binary words
St000627: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> 1 => 1
([],2)
=> [1,1]
=> 11 => 2
([(0,1)],2)
=> [2]
=> 0 => 1
([],3)
=> [1,1,1]
=> 111 => 3
([(1,2)],3)
=> [2,1]
=> 01 => 1
([(0,2),(1,2)],3)
=> [2,2]
=> 00 => 2
([(0,1),(0,2),(1,2)],3)
=> [3]
=> 1 => 1
([],4)
=> [1,1,1,1]
=> 1111 => 4
([(2,3)],4)
=> [2,1,1]
=> 011 => 1
([(1,3),(2,3)],4)
=> [2,2,1]
=> 001 => 1
([(0,3),(1,3),(2,3)],4)
=> [2,2,2]
=> 000 => 3
([(0,3),(1,2)],4)
=> [2,2]
=> 00 => 2
([(0,3),(1,2),(2,3)],4)
=> [2,2,2]
=> 000 => 3
([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> 11 => 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,2]
=> 10 => 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2,2,2]
=> 0000 => 4
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [3,3]
=> 11 => 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 0 => 1
Description
The exponent of a binary word.
This is the largest number $e$ such that $w$ is the concatenation of $e$ identical factors. This statistic is also called '''frequency'''.
Matching statistic: St000722
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> ([(0,1)],2)
=> 2
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2)],3)
=> ([],2)
=> ([(0,1)],2)
=> 2
([(0,2),(1,2)],3)
=> ([],1)
=> ([],1)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 1
([],4)
=> ([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,3)],4)
=> ([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,3),(2,3)],4)
=> ([],2)
=> ([(0,1)],2)
=> 2
([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([(0,1)],2)
=> 2
([(0,3),(1,2),(2,3)],4)
=> ([],1)
=> ([],1)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> 4
([(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)
=> 3
([(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)
=> 1
Description
The number of different neighbourhoods in a graph.
Matching statistic: St000733
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00251: Graphs —clique sizes⟶ Integer partitions
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
St000733: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
St000733: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> [[1]]
=> 1
([],2)
=> [1,1]
=> [[1],[2]]
=> 2
([(0,1)],2)
=> [2]
=> [[1,2]]
=> 1
([],3)
=> [1,1,1]
=> [[1],[2],[3]]
=> 3
([(1,2)],3)
=> [2,1]
=> [[1,3],[2]]
=> 1
([(0,2),(1,2)],3)
=> [2,2]
=> [[1,2],[3,4]]
=> 2
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [[1,2,3]]
=> 1
([],4)
=> [1,1,1,1]
=> [[1],[2],[3],[4]]
=> 4
([(2,3)],4)
=> [2,1,1]
=> [[1,4],[2],[3]]
=> 1
([(1,3),(2,3)],4)
=> [2,2,1]
=> [[1,3],[2,5],[4]]
=> 2
([(0,3),(1,3),(2,3)],4)
=> [2,2,2]
=> [[1,2],[3,4],[5,6]]
=> 3
([(0,3),(1,2)],4)
=> [2,2]
=> [[1,2],[3,4]]
=> 2
([(0,3),(1,2),(2,3)],4)
=> [2,2,2]
=> [[1,2],[3,4],[5,6]]
=> 3
([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [[1,3,4],[2]]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,2]
=> [[1,2,5],[3,4]]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2,2,2]
=> [[1,2],[3,4],[5,6],[7,8]]
=> 4
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [3,3]
=> [[1,2,3],[4,5,6]]
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [[1,2,3,4]]
=> 1
Description
The row containing the largest entry of a standard tableau.
Matching statistic: St000993
(load all 14 compositions to match this statistic)
(load all 14 compositions to match this statistic)
Mp00203: Graphs —cone⟶ Graphs
Mp00251: Graphs —clique sizes⟶ Integer partitions
St000993: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00251: Graphs —clique sizes⟶ Integer partitions
St000993: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> ([(0,1)],2)
=> [2]
=> 1
([],2)
=> ([(0,2),(1,2)],3)
=> [2,2]
=> 2
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 1
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> [2,2,2]
=> 3
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,2]
=> 1
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [3,3]
=> 2
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [2,2,2,2]
=> 4
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2,2]
=> 1
([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,3,2]
=> 2
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,3,3]
=> 3
([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> 2
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,3,3]
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,2]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,3]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [3,3,3,3]
=> 4
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,4]
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1
Description
The multiplicity of the largest part of an integer partition.
The following 388 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001316The domatic number of a graph. St001725The harmonious chromatic number of a graph. St001884The number of borders of a binary word. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000295The length of the border of a binary word. St000310The minimal degree of a vertex of a graph. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. 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. 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. St000008The major index of the composition. St000326The position of the first one in a binary word after appending a 1 at the end. 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$. 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}$. 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. 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. 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. St000932The number of occurrences of the pattern UDU in a 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. St000668The least common multiple of the parts of the partition. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St000667The greatest common divisor of the parts of the partition. St000675The number of centered multitunnels of a Dyck path. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001571The Cartan determinant of the integer partition. St001645The pebbling number of a connected graph. St001956The comajor index for set-valued two-row standard Young tableaux. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001112The 3-weak dynamic number of a graph. 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. St001342The number of vertices in the center of a graph. St001368The number of vertices of maximal degree in a graph. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001202Call 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. St001215Let 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. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001480The number of simple summands of the module J^2/J^3. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St000454The largest eigenvalue of a graph if it is integral. St000741The Colin de Verdière graph invariant. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St000524The number of posets with the same order polynomial. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St001281The normalized isoperimetric number of a graph. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001672The restrained domination number of a graph. St000418The number of Dyck paths that are weakly below a Dyck path. St000681The Grundy value of Chomp on Ferrers diagrams. St000815The number of semistandard Young tableaux of partition weight of given shape. St000933The number of multipartitions of sizes given by an integer partition. St001531Number of partial orders contained in the poset determined by the Dyck path. St001959The product of the heights of the peaks of a Dyck path. St001330The hat guessing number of a graph. St000420The number of Dyck paths that are weakly above a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001500The global dimension of magnitude 1 Nakayama algebras. St001621The number of atoms of a lattice. St001808The box weight or horizontal decoration of a Dyck path. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000259The diameter of a connected graph. St000260The radius of a connected graph. St001570The minimal number of edges to add to make a graph Hamiltonian. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000934The 2-degree of an integer 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. St000460The hook length of the last cell along the main diagonal of an integer partition. St000640The rank of the largest boolean interval in a poset. St000699The toughness times the least common multiple of 1,. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000910The number of maximal chains of minimal length in a poset. St001060The distinguishing index of a graph. St001118The acyclic chromatic index of a graph. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001360The number of covering relations in Young's lattice below a partition. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001527The cyclic permutation representation number of an integer partition. St001602The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on endofunctions. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. 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. St001890The maximum magnitude of the Möbius function of a poset. St001933The largest multiplicity of a part in an integer partition. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St000003The number of standard Young tableaux of the partition. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000010The length of the partition. St000014The number of parking functions supported by a Dyck path. St000015The number of peaks of a Dyck path. St000026The position of the first return of a Dyck path. St000032The number of elements smaller than the given Dyck path in the Tamari Order. St000038The product of the heights of the descending steps of a Dyck path. St000048The multinomial of the parts of a partition. St000049The number of set partitions whose sorted block sizes correspond to the partition. St000063The number of linear extensions of a certain poset defined for an integer partition. St000079The number of alternating sign matrices for a given Dyck path. St000108The number of partitions contained in the given partition. St000120The number of left tunnels of a Dyck path. St000144The pyramid weight of the Dyck path. St000147The largest part of an integer partition. St000159The number of distinct parts of the integer partition. St000179The product of the hook lengths of the integer partition. St000182The number of permutations whose cycle type is the given integer partition. St000184The size of the centralizer of any permutation of given cycle type. St000228The size of a partition. St000275Number of permutations whose sorted list of non zero multiplicities of the Lehmer code is the given partition. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000285The size of the preimage of the map 'to inverse des composition' from Parking functions to Integer compositions. St000288The number of ones in a binary word. St000290The major index of a binary word. St000293The number of inversions of a binary word. St000294The number of distinct factors of a binary word. St000296The length of the symmetric border of a binary word. 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. St000335The difference of lower and upper interactions. St000345The number of refinements of a partition. St000346The number of coarsenings of a 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. St000393The number of strictly increasing runs in a binary word. St000395The sum of the heights of the peaks of a Dyck path. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000439The position of the first down 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. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000511The number of invariant subsets when acting with a permutation of given cycle type. St000517The Kreweras number of an integer partition. St000518The number of distinct subsequences in a binary word. St000519The largest length of a factor maximising the subword complexity. St000529The number of permutations whose descent word is the given binary word. 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. St000543The size of the conjugacy class of a binary word. St000548The number of different non-empty partial sums of an integer partition. St000626The minimal period of a binary word. St000631The number of distinct palindromic decompositions of a binary word. St000655The length of the minimal rise of a Dyck path. St000674The number of hills of a Dyck path. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000705The number of semistandard tableaux on a given integer partition of n with maximal entry n. St000707The product of the factorials of the parts. St000715The number of semistandard Young tableaux of given shape and entries at most 3. St000734The last entry in the first row of a standard tableau. St000738The first entry in the last row of a standard tableau. St000753The Grundy value for the game of Kayles on a binary word. St000759The smallest missing part in an integer partition. St000762The sum of the positions of the weak records of an integer composition. 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. St000792The Grundy value for the game of ruler on a binary word. St000810The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to monomial symmetric functions. 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. St000812The sum of the entries in the column specified by the partition of the change of basis matrix from complete homogeneous symmetric functions to monomial symmetric functions. St000814The sum of the entries in the column specified by the partition of the change of basis matrix from elementary symmetric functions to Schur symmetric functions. St000867The sum of the hook lengths in the first row of an integer partition. St000876The number of factors in the Catalan decomposition of a binary word. St000885The number of critical steps in the Catalan decomposition of a binary word. St000922The minimal number such that all substrings of this length are unique. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000935The number of ordered refinements of 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. St000947The major index east count of a Dyck path. St000952Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St000965The sum of the dimension of Ext^i(D(A),A) for i=1,. St000968We 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}$. St000982The length of the longest constant subword. St001006Number of simple modules with projective 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. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension 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. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001019Sum of the projective dimensions of the simple modules 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. St001023Number of simple modules with projective dimension at most 3 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. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001127The sum of the squares of the parts of a partition. St001129The product of the squares of the parts of a partition. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001161The major index north count of a Dyck path. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001170Number of indecomposable injective modules whose socle has projective dimension at most g-1 when g denotes the global dimension in the corresponding Nakayama algebra. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001180Number of indecomposable injective modules with projective dimension at most 1. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001190Number of simple modules with projective dimension at most 4 in the corresponding Nakayama algebra. St001191Number of simple modules $S$ with $Ext_A^i(S,A)=0$ for all $i=0,1,...,g-1$ in the corresponding Nakayama algebra $A$ with global dimension $g$. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001203We associate to 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 Dyck path as follows:
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. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001254The vector space dimension of the first extension-group between A/soc(A) and J when A is the corresponding Nakayama algebra with Jacobson radical J. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001267The length of the Lyndon factorization of the binary word. St001289The vector space dimension of the n-fold tensor product of D(A), where n is maximal such that this n-fold tensor product is nonzero. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. 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. St001299The product of all non-zero projective dimensions of simple modules of the corresponding Nakayama algebra. St001348The bounce of the parallelogram polyomino associated with the Dyck path. St001365The number of lattice paths of the same length weakly above the path given by a binary word. St001372The length of a longest cyclic run of ones of a binary word. St001378The product of the cohook lengths of the integer partition. 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. 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. St001432The order dimension of the partition. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001437The flex of a binary word. St001462The number of factors of a standard tableaux under concatenation. St001471The magnitude of a Dyck path. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St001485The modular major index of a binary word. St001488The number of corners of a skew partition. St001492The number of simple modules that do not appear in the socle of the regular module or have no nontrivial selfextensions with the regular module in the corresponding Nakayama algebra. St001498The normalised height of a Nakayama algebra with magnitude 1. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001504The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path. St001523The degree of symmetry of a Dyck path. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001530The depth of a Dyck path. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. 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. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001612The number of coloured multisets of cycles such that the multiplicities of colours are given by a partition. St001614The cyclic permutation representation number of a skew partition. St001643The Frobenius dimension of the Nakayama algebra corresponding to the Dyck path. St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St001658The total number of rook placements on a Ferrers board. 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. St001710The number of permutations such that conjugation with a permutation of given cycle type yields the inverse permutation. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001721The degree of a binary word. St001732The number of peaks visible from the left. St001763The Hurwitz number of an integer partition. St001780The order of promotion on the set of standard tableaux of given shape. St001786The number of total orderings of the north steps of a Dyck path such that steps after the k-th east step are not among the first k positions in the order. St001809The index of the step at the first peak of maximal height in a Dyck path. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. St001885The number of binary words with the same proper border set. 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. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St001929The number of meanders with top half given by the noncrossing matching corresponding to the Dyck path. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001938The number of transitive monotone factorizations of genus zero of a permutation of given cycle type. St001955The number of natural descents for set-valued two row standard Young tableaux. St001568The smallest positive integer that does not appear twice in the partition. St001877Number of indecomposable injective modules with projective dimension 2. St001644The dimension of a graph. St000456The monochromatic index of a connected graph. St001262The dimension of the maximal parabolic seaweed algebra corresponding to the partition. St001610The number of coloured endofunctions such that the multiplicities of colours are given by a partition. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001249Sum of the odd parts of a partition. St001529The number of monomials in the expansion of the nabla operator applied to the power-sum symmetric function indexed by the partition. St001561The value of the elementary symmetric function evaluated at 1. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St000046The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition. St000706The product of the factorials of the multiplicities of an integer partition. St001176The size of a partition minus its first part. 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. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001600The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. 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. St000284The Plancherel distribution on integer partitions. St000379The number of Hamiltonian cycles in a graph. St000478Another weight of a partition according to Alladi. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000928The sum of the coefficients of the character polynomial of an integer partition. St001128The exponens consonantiae of a partition. St001592The maximal number of simple paths between any two different vertices of a graph. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St000455The second largest eigenvalue of a graph if it is integral. St001651The Frankl number of a lattice. St000618The number of self-evacuating tableaux of given shape. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000781The number of proper colouring schemes of a Ferrers diagram. St000929The constant term of the character polynomial of an integer partition. St000941The number of characters of the symmetric group whose value on the partition is even. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St000422The energy of a graph, if it is integral. St000264The girth of a graph, which is not a tree. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St001545The second Elser number of a connected graph. St001617The dimension of the space of valuations of a lattice. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. 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. St001845The number of join irreducibles minus the rank of a lattice. St000438The position of the last up step in a Dyck path. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000714The number of semistandard Young tableau of given shape, with entries at most 2. 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. St000981The length of the longest zigzag subpath. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001626The number of maximal proper sublattices of a lattice.
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!