Your data matches 117 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001235: Integer compositions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => 1
[1,1] => 2
[2] => 1
[1,1,1] => 3
[1,2] => 2
[2,1] => 2
[3] => 1
[1,1,1,1] => 4
[1,1,2] => 3
[1,2,1] => 2
[1,3] => 2
[2,1,1] => 3
[2,2] => 2
[3,1] => 2
[4] => 1
[1,1,1,1,1] => 5
[1,1,1,2] => 4
[1,1,2,1] => 3
[1,1,3] => 3
[1,2,1,1] => 3
[1,2,2] => 2
[1,3,1] => 2
[1,4] => 2
[2,1,1,1] => 4
[2,1,2] => 3
[2,2,1] => 2
[2,3] => 2
[3,1,1] => 3
[3,2] => 2
[4,1] => 2
[5] => 1
[1,1,1,1,1,1] => 6
[1,1,1,1,2] => 5
[1,1,1,2,1] => 4
[1,1,1,3] => 4
[1,1,2,1,1] => 3
[1,1,2,2] => 3
[1,1,3,1] => 3
[1,1,4] => 3
[1,2,1,1,1] => 4
[1,2,1,2] => 3
[1,2,2,1] => 2
[1,2,3] => 2
[1,3,1,1] => 3
[1,3,2] => 2
[1,4,1] => 2
[1,5] => 2
[2,1,1,1,1] => 5
[2,1,1,2] => 4
[2,1,2,1] => 3
Description
The global dimension of the corresponding Comp-Nakayama algebra. We identify the composition [n1-1,n2-1,...,nr-1] with the Nakayama algebra with Kupisch series [n1,n1-1,...,2,n2,n2-1,...,2,...,nr,nr-1,...,3,2,1]. We call such Nakayama algebras with Kupisch series corresponding to a integer composition "Comp-Nakayama algebra".
Mp00041: Integer compositions conjugateInteger compositions
St000381: Integer compositions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1] => 1
[1,1] => [2] => 2
[2] => [1,1] => 1
[1,1,1] => [3] => 3
[1,2] => [1,2] => 2
[2,1] => [2,1] => 2
[3] => [1,1,1] => 1
[1,1,1,1] => [4] => 4
[1,1,2] => [1,3] => 3
[1,2,1] => [2,2] => 2
[1,3] => [1,1,2] => 2
[2,1,1] => [3,1] => 3
[2,2] => [1,2,1] => 2
[3,1] => [2,1,1] => 2
[4] => [1,1,1,1] => 1
[1,1,1,1,1] => [5] => 5
[1,1,1,2] => [1,4] => 4
[1,1,2,1] => [2,3] => 3
[1,1,3] => [1,1,3] => 3
[1,2,1,1] => [3,2] => 3
[1,2,2] => [1,2,2] => 2
[1,3,1] => [2,1,2] => 2
[1,4] => [1,1,1,2] => 2
[2,1,1,1] => [4,1] => 4
[2,1,2] => [1,3,1] => 3
[2,2,1] => [2,2,1] => 2
[2,3] => [1,1,2,1] => 2
[3,1,1] => [3,1,1] => 3
[3,2] => [1,2,1,1] => 2
[4,1] => [2,1,1,1] => 2
[5] => [1,1,1,1,1] => 1
[1,1,1,1,1,1] => [6] => 6
[1,1,1,1,2] => [1,5] => 5
[1,1,1,2,1] => [2,4] => 4
[1,1,1,3] => [1,1,4] => 4
[1,1,2,1,1] => [3,3] => 3
[1,1,2,2] => [1,2,3] => 3
[1,1,3,1] => [2,1,3] => 3
[1,1,4] => [1,1,1,3] => 3
[1,2,1,1,1] => [4,2] => 4
[1,2,1,2] => [1,3,2] => 3
[1,2,2,1] => [2,2,2] => 2
[1,2,3] => [1,1,2,2] => 2
[1,3,1,1] => [3,1,2] => 3
[1,3,2] => [1,2,1,2] => 2
[1,4,1] => [2,1,1,2] => 2
[1,5] => [1,1,1,1,2] => 2
[2,1,1,1,1] => [5,1] => 5
[2,1,1,2] => [1,4,1] => 4
[2,1,2,1] => [2,3,1] => 3
Description
The largest part of an integer composition.
Mp00231: Integer compositions bounce pathDyck paths
St000684: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> 1
[1,1] => [1,0,1,0]
=> 2
[2] => [1,1,0,0]
=> 1
[1,1,1] => [1,0,1,0,1,0]
=> 3
[1,2] => [1,0,1,1,0,0]
=> 2
[2,1] => [1,1,0,0,1,0]
=> 2
[3] => [1,1,1,0,0,0]
=> 1
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,1,2] => [1,0,1,0,1,1,0,0]
=> 3
[1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[1,3] => [1,0,1,1,1,0,0,0]
=> 2
[2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[2,2] => [1,1,0,0,1,1,0,0]
=> 2
[3,1] => [1,1,1,0,0,0,1,0]
=> 2
[4] => [1,1,1,1,0,0,0,0]
=> 1
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 3
[1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 3
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 3
[1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2
[5] => [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0]
=> 5
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0]
=> 4
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0]
=> 4
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
=> 3
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0]
=> 3
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0]
=> 4
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0]
=> 3
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0]
=> 2
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> 3
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> 2
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> 2
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> 5
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> 4
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> 3
Description
The global dimension of the LNakayama algebra associated to a Dyck path. An n-LNakayama algebra is a quiver algebra with a directed line as a connected quiver with $n$ points for $n \geq 2$. Number those points from the left to the right by $0,1,\ldots,n-1$. The algebra is then uniquely determined by the dimension $c_i$ of the projective indecomposable modules at point $i$. Such algebras are then uniquely determined by lists of the form $[c_0,c_1,...,c_{n-1}]$ with the conditions: $c_{n-1}=1$ and $c_i -1 \leq c_{i+1}$ for all $i$. The number of such algebras is then the $n-1$-st Catalan number $C_{n-1}$. One can get also an interpretation with Dyck paths by associating the top boundary of the Auslander-Reiten quiver (which is a Dyck path) to those algebras. Example: [3,4,3,3,2,1] corresponds to the Dyck path [1,1,0,1,1,0,0,1,0,0]. Conjecture: that there is an explicit bijection between $n$-LNakayama algebras with global dimension bounded by $m$ and Dyck paths with height at most $m$. Examples: * For $m=2$, the number of Dyck paths with global dimension at most $m$ starts for $n \geq 2$ with 1,2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192. * For $m=3$, the number of Dyck paths with global dimension at most $m$ starts for $n \geq 2$ with 1, 2, 5, 13, 34, 89, 233, 610, 1597, 4181, 10946, 28657, 75025, 196418.
Mp00231: Integer compositions bounce pathDyck paths
St000686: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> 1
[1,1] => [1,0,1,0]
=> 2
[2] => [1,1,0,0]
=> 1
[1,1,1] => [1,0,1,0,1,0]
=> 3
[1,2] => [1,0,1,1,0,0]
=> 2
[2,1] => [1,1,0,0,1,0]
=> 2
[3] => [1,1,1,0,0,0]
=> 1
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,1,2] => [1,0,1,0,1,1,0,0]
=> 3
[1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[1,3] => [1,0,1,1,1,0,0,0]
=> 2
[2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[2,2] => [1,1,0,0,1,1,0,0]
=> 2
[3,1] => [1,1,1,0,0,0,1,0]
=> 2
[4] => [1,1,1,1,0,0,0,0]
=> 1
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 3
[1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 3
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 3
[1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2
[5] => [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0]
=> 5
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0]
=> 4
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0]
=> 4
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
=> 3
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0]
=> 3
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0]
=> 4
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0]
=> 3
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0]
=> 2
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> 3
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> 2
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> 2
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> 5
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> 4
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> 3
Description
The finitistic dominant dimension of a Dyck path. To every LNakayama algebra there is a corresponding Dyck path, see also [[St000684]]. We associate the finitistic dominant dimension of the algebra to the corresponding Dyck path.
Mp00231: Integer compositions bounce pathDyck paths
St000930: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> 1
[1,1] => [1,0,1,0]
=> 2
[2] => [1,1,0,0]
=> 1
[1,1,1] => [1,0,1,0,1,0]
=> 3
[1,2] => [1,0,1,1,0,0]
=> 2
[2,1] => [1,1,0,0,1,0]
=> 2
[3] => [1,1,1,0,0,0]
=> 1
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,1,2] => [1,0,1,0,1,1,0,0]
=> 3
[1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[1,3] => [1,0,1,1,1,0,0,0]
=> 2
[2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[2,2] => [1,1,0,0,1,1,0,0]
=> 2
[3,1] => [1,1,1,0,0,0,1,0]
=> 2
[4] => [1,1,1,1,0,0,0,0]
=> 1
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 3
[1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 3
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 3
[1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2
[5] => [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0]
=> 5
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0]
=> 4
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0]
=> 4
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
=> 3
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0]
=> 3
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0]
=> 4
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0]
=> 3
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0]
=> 2
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> 3
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> 2
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> 2
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> 5
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> 4
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> 3
Description
The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. The $k$-Gorenstein degree is the maximal number $k$ such that the algebra is $k$-Gorenstein. We apply the convention that the value is equal to the global dimension of the algebra in case the $k$-Gorenstein degree is greater than or equal to the global dimension.
Mp00231: Integer compositions bounce pathDyck paths
St001530: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> 1
[1,1] => [1,0,1,0]
=> 2
[2] => [1,1,0,0]
=> 1
[1,1,1] => [1,0,1,0,1,0]
=> 3
[1,2] => [1,0,1,1,0,0]
=> 2
[2,1] => [1,1,0,0,1,0]
=> 2
[3] => [1,1,1,0,0,0]
=> 1
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,1,2] => [1,0,1,0,1,1,0,0]
=> 3
[1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[1,3] => [1,0,1,1,1,0,0,0]
=> 2
[2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[2,2] => [1,1,0,0,1,1,0,0]
=> 2
[3,1] => [1,1,1,0,0,0,1,0]
=> 2
[4] => [1,1,1,1,0,0,0,0]
=> 1
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 3
[1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 3
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 3
[1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2
[5] => [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0]
=> 5
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0]
=> 4
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0]
=> 4
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
=> 3
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0]
=> 3
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0]
=> 4
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0]
=> 3
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0]
=> 2
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> 3
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> 2
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> 2
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> 5
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> 4
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> 3
Description
The depth of a Dyck path. That is the depth of the corresponding Nakayama algebra with a linear quiver.
Mp00231: Integer compositions bounce pathDyck paths
St001294: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> 0 = 1 - 1
[1,1] => [1,0,1,0]
=> 1 = 2 - 1
[2] => [1,1,0,0]
=> 0 = 1 - 1
[1,1,1] => [1,0,1,0,1,0]
=> 2 = 3 - 1
[1,2] => [1,0,1,1,0,0]
=> 1 = 2 - 1
[2,1] => [1,1,0,0,1,0]
=> 1 = 2 - 1
[3] => [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[1,1,2] => [1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,3] => [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[2,1,1] => [1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[2,2] => [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[4] => [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 3 = 4 - 1
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2 = 3 - 1
[3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1 = 2 - 1
[5] => [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> 5 = 6 - 1
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0]
=> 4 = 5 - 1
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0]
=> 3 = 4 - 1
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0]
=> 3 = 4 - 1
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0]
=> 2 = 3 - 1
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> 2 = 3 - 1
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> 1 = 2 - 1
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1 = 2 - 1
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> 3 = 4 - 1
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
Description
The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. See [[http://www.findstat.org/DyckPaths/NakayamaAlgebras]]. The number of algebras where the statistic returns a value less than or equal to 1 might be given by the Motzkin numbers https://oeis.org/A001006.
Mp00231: Integer compositions bounce pathDyck paths
St001296: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> 0 = 1 - 1
[1,1] => [1,0,1,0]
=> 1 = 2 - 1
[2] => [1,1,0,0]
=> 0 = 1 - 1
[1,1,1] => [1,0,1,0,1,0]
=> 2 = 3 - 1
[1,2] => [1,0,1,1,0,0]
=> 1 = 2 - 1
[2,1] => [1,1,0,0,1,0]
=> 1 = 2 - 1
[3] => [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[1,1,2] => [1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,3] => [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[2,1,1] => [1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[2,2] => [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[4] => [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 3 = 4 - 1
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2 = 3 - 1
[3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1 = 2 - 1
[5] => [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> 5 = 6 - 1
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0]
=> 4 = 5 - 1
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0]
=> 3 = 4 - 1
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0]
=> 3 = 4 - 1
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0]
=> 2 = 3 - 1
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> 2 = 3 - 1
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> 1 = 2 - 1
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1 = 2 - 1
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> 3 = 4 - 1
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
Description
The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. See [[http://www.findstat.org/DyckPaths/NakayamaAlgebras]].
Mp00039: Integer compositions complementInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St000013: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1,0]
=> 1
[1,1] => [2] => [1,1,0,0]
=> 2
[2] => [1,1] => [1,0,1,0]
=> 1
[1,1,1] => [3] => [1,1,1,0,0,0]
=> 3
[1,2] => [2,1] => [1,1,0,0,1,0]
=> 2
[2,1] => [1,2] => [1,0,1,1,0,0]
=> 2
[3] => [1,1,1] => [1,0,1,0,1,0]
=> 1
[1,1,1,1] => [4] => [1,1,1,1,0,0,0,0]
=> 4
[1,1,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> 3
[1,2,1] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,3] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[2,1,1] => [1,3] => [1,0,1,1,1,0,0,0]
=> 3
[2,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[3,1] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 2
[4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 1
[1,1,1,1,1] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,1,1,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 4
[1,1,2,1] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,1,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[1,2,1,1] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 3
[1,2,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,3,1] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,4] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2
[2,1,1,1] => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 4
[2,1,2] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 3
[2,2,1] => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2
[2,3] => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 2
[3,1,1] => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 3
[3,2] => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 2
[4,1] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 2
[5] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,1,1,1,1,1] => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,1,1,1,2] => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> 5
[1,1,1,2,1] => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
=> 4
[1,1,1,3] => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
=> 4
[1,1,2,1,1] => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> 3
[1,1,2,2] => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 3
[1,1,3,1] => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
=> 3
[1,1,4] => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
=> 3
[1,2,1,1,1] => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
=> 4
[1,2,1,2] => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> 3
[1,2,2,1] => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
=> 2
[1,2,3] => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> 2
[1,3,1,1] => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> 3
[1,3,2] => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> 2
[1,4,1] => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> 2
[1,5] => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> 2
[2,1,1,1,1] => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> 5
[2,1,1,2] => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> 4
[2,1,2,1] => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> 3
Description
The height of a Dyck path. The height of a Dyck path $D$ of semilength $n$ is defined as the maximal height of a peak of $D$. The height of $D$ at position $i$ is the number of up-steps minus the number of down-steps before position $i$.
Matching statistic: St000147
Mp00039: Integer compositions complementInteger compositions
Mp00040: Integer compositions to partitionInteger partitions
St000147: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1]
=> 1
[1,1] => [2] => [2]
=> 2
[2] => [1,1] => [1,1]
=> 1
[1,1,1] => [3] => [3]
=> 3
[1,2] => [2,1] => [2,1]
=> 2
[2,1] => [1,2] => [2,1]
=> 2
[3] => [1,1,1] => [1,1,1]
=> 1
[1,1,1,1] => [4] => [4]
=> 4
[1,1,2] => [3,1] => [3,1]
=> 3
[1,2,1] => [2,2] => [2,2]
=> 2
[1,3] => [2,1,1] => [2,1,1]
=> 2
[2,1,1] => [1,3] => [3,1]
=> 3
[2,2] => [1,2,1] => [2,1,1]
=> 2
[3,1] => [1,1,2] => [2,1,1]
=> 2
[4] => [1,1,1,1] => [1,1,1,1]
=> 1
[1,1,1,1,1] => [5] => [5]
=> 5
[1,1,1,2] => [4,1] => [4,1]
=> 4
[1,1,2,1] => [3,2] => [3,2]
=> 3
[1,1,3] => [3,1,1] => [3,1,1]
=> 3
[1,2,1,1] => [2,3] => [3,2]
=> 3
[1,2,2] => [2,2,1] => [2,2,1]
=> 2
[1,3,1] => [2,1,2] => [2,2,1]
=> 2
[1,4] => [2,1,1,1] => [2,1,1,1]
=> 2
[2,1,1,1] => [1,4] => [4,1]
=> 4
[2,1,2] => [1,3,1] => [3,1,1]
=> 3
[2,2,1] => [1,2,2] => [2,2,1]
=> 2
[2,3] => [1,2,1,1] => [2,1,1,1]
=> 2
[3,1,1] => [1,1,3] => [3,1,1]
=> 3
[3,2] => [1,1,2,1] => [2,1,1,1]
=> 2
[4,1] => [1,1,1,2] => [2,1,1,1]
=> 2
[5] => [1,1,1,1,1] => [1,1,1,1,1]
=> 1
[1,1,1,1,1,1] => [6] => [6]
=> 6
[1,1,1,1,2] => [5,1] => [5,1]
=> 5
[1,1,1,2,1] => [4,2] => [4,2]
=> 4
[1,1,1,3] => [4,1,1] => [4,1,1]
=> 4
[1,1,2,1,1] => [3,3] => [3,3]
=> 3
[1,1,2,2] => [3,2,1] => [3,2,1]
=> 3
[1,1,3,1] => [3,1,2] => [3,2,1]
=> 3
[1,1,4] => [3,1,1,1] => [3,1,1,1]
=> 3
[1,2,1,1,1] => [2,4] => [4,2]
=> 4
[1,2,1,2] => [2,3,1] => [3,2,1]
=> 3
[1,2,2,1] => [2,2,2] => [2,2,2]
=> 2
[1,2,3] => [2,2,1,1] => [2,2,1,1]
=> 2
[1,3,1,1] => [2,1,3] => [3,2,1]
=> 3
[1,3,2] => [2,1,2,1] => [2,2,1,1]
=> 2
[1,4,1] => [2,1,1,2] => [2,2,1,1]
=> 2
[1,5] => [2,1,1,1,1] => [2,1,1,1,1]
=> 2
[2,1,1,1,1] => [1,5] => [5,1]
=> 5
[2,1,1,2] => [1,4,1] => [4,1,1]
=> 4
[2,1,2,1] => [1,3,2] => [3,2,1]
=> 3
Description
The largest part of an integer partition.
The following 107 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000982The length of the longest constant subword. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000028The number of stack-sorts needed to sort a permutation. St000209Maximum difference of elements in cycles. St001090The number of pop-stack-sorts needed to sort a permutation. St000010The length of the partition. St000025The number of initial rises of a Dyck path. St000062The length of the longest increasing subsequence of the permutation. St000166The depth minus 1 of an ordered tree. St000299The number of nonisomorphic vertex-induced subtrees. St000308The height of the tree associated to a permutation. St000328The maximum number of child nodes in a tree. St000392The length of the longest run of ones in a binary word. St000442The maximal area to the right of an up step of a Dyck path. St000444The length of the maximal rise of a Dyck path. St000451The length of the longest pattern of the form k 1 2. St000628The balance of a binary word. St000651The maximal size of a rise in a permutation. St000676The number of odd rises of a Dyck path. St000720The size of the largest partition in the oscillating tableau corresponding to the perfect matching. St000734The last entry in the first row of a standard tableau. St000983The length of the longest alternating subword. St001058The breadth of the ordered tree. 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. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001268The size of the largest ordinal summand in the poset. St001372The length of a longest cyclic run of ones of a binary word. St001652The length of a longest interval of consecutive numbers. St001674The number of vertices of the largest induced star graph in the graph. St001809The index of the step at the first peak of maximal height in a Dyck path. St000094The depth of an ordered tree. St000141The maximum drop size of a permutation. St000171The degree of the graph. St000306The bounce count of a Dyck path. St000439The position of the first down step of a Dyck path. St000521The number of distinct subtrees of an ordered tree. St000662The staircase size of the code of a permutation. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a 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. St001046The maximal number of arcs nesting a given arc of a perfect matching. St001117The game chromatic index of a graph. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001826The maximal number of leaves on a vertex of a graph. St000485The length of the longest cycle of a permutation. St000844The size of the largest block in the direct sum decomposition of a permutation. St000956The maximal displacement of a permutation. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001062The maximal size of a block of a set partition. St000503The maximal difference between two elements in a common block. St000730The maximal arc length of a set partition. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000652The maximal difference between successive positions of a permutation. St001118The acyclic chromatic index of a graph. St001933The largest multiplicity of a part in an integer partition. St001330The hat guessing number of a graph. St000454The largest eigenvalue of a graph if it is integral. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001589The nesting number of a perfect matching. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001651The Frankl number of a lattice. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St000035The number of left outer peaks of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000742The number of big ascents of a permutation after prepending zero. St000871The number of very big ascents of a permutation. St001875The number of simple modules with projective dimension at most 1. St000056The decomposition (or block) number of a permutation. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St000239The number of small weak excedances. St000314The number of left-to-right-maxima of a permutation. St000354The number of recoils of a permutation. St000502The number of successions of a set partitions. St000991The number of right-to-left minima of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001461The number of topologically connected components of the chord diagram of a permutation. St001489The maximum of the number of descents and the number of inverse descents. St001665The number of pure excedances of a permutation. St001737The number of descents of type 2 in a permutation. St001859The number of factors of the Stanley symmetric function associated with a permutation. St000023The number of inner peaks of a permutation. St000234The number of global ascents of a permutation. St000353The number of inner valleys of a permutation. St000486The number of cycles of length at least 3 of a permutation. St000646The number of big ascents of a permutation. St000663The number of right floats of a permutation. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000824The sum of the number of descents and the number of recoils of a permutation. St001388The number of non-attacking neighbors of a permutation. St001469The holeyness of a permutation. St001470The cyclic holeyness of a permutation. St001712The number of natural descents of a standard Young tableau. St001816Eigenvalues of the top-to-random operator acting on a simple module. St000668The least common multiple of the parts of the partition. St000770The major index of an integer partition when read from bottom to top. St000937The number of positive values of the symmetric group character corresponding to the partition. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001645The pebbling number of a connected graph. St000259The diameter of a connected graph. St000260The radius of a connected graph. 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.