Your data matches 412 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000256
(load all 11 compositions to match this statistic)
Mapping
St000256: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => 0 = 1 - 1
[2]
 => 1 = 2 - 1
[1,1]
 => 0 = 1 - 1
[3]
 => 1 = 2 - 1
[2,1]
 => 0 = 1 - 1
[1,1,1]
 => 0 = 1 - 1
[4]
 => 1 = 2 - 1
[3,1]
 => 1 = 2 - 1
[2,2]
 => 1 = 2 - 1
[2,1,1]
 => 0 = 1 - 1
[1,1,1,1]
 => 0 = 1 - 1
[5]
 => 1 = 2 - 1
[4,1]
 => 1 = 2 - 1
[3,2]
 => 1 = 2 - 1
[3,1,1]
 => 1 = 2 - 1
[2,2,1]
 => 0 = 1 - 1
[2,1,1,1]
 => 0 = 1 - 1
[1,1,1,1,1]
 => 0 = 1 - 1
[6]
 => 1 = 2 - 1
[5,1]
 => 1 = 2 - 1
[4,2]
 => 2 = 3 - 1
[4,1,1]
 => 1 = 2 - 1
[3,3]
 => 1 = 2 - 1
[3,2,1]
 => 0 = 1 - 1
[3,1,1,1]
 => 1 = 2 - 1
[2,2,2]
 => 1 = 2 - 1
[2,2,1,1]
 => 0 = 1 - 1
[2,1,1,1,1]
 => 0 = 1 - 1
[1,1,1,1,1,1]
 => 0 = 1 - 1
Description
The number of parts from which one can substract 2 and still get an integer partition.
Matching statistic: St000257
(load all 7 compositions to match this statistic)
Mapping
St000257: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => 0 = 1 - 1
[2]
 => 0 = 1 - 1
[1,1]
 => 1 = 2 - 1
[3]
 => 0 = 1 - 1
[2,1]
 => 0 = 1 - 1
[1,1,1]
 => 1 = 2 - 1
[4]
 => 0 = 1 - 1
[3,1]
 => 0 = 1 - 1
[2,2]
 => 1 = 2 - 1
[2,1,1]
 => 1 = 2 - 1
[1,1,1,1]
 => 1 = 2 - 1
[5]
 => 0 = 1 - 1
[4,1]
 => 0 = 1 - 1
[3,2]
 => 0 = 1 - 1
[3,1,1]
 => 1 = 2 - 1
[2,2,1]
 => 1 = 2 - 1
[2,1,1,1]
 => 1 = 2 - 1
[1,1,1,1,1]
 => 1 = 2 - 1
[6]
 => 0 = 1 - 1
[5,1]
 => 0 = 1 - 1
[4,2]
 => 0 = 1 - 1
[4,1,1]
 => 1 = 2 - 1
[3,3]
 => 1 = 2 - 1
[3,2,1]
 => 0 = 1 - 1
[3,1,1,1]
 => 1 = 2 - 1
[2,2,2]
 => 1 = 2 - 1
[2,2,1,1]
 => 2 = 3 - 1
[2,1,1,1,1]
 => 1 = 2 - 1
[1,1,1,1,1,1]
 => 1 = 2 - 1
Description
The number of distinct parts of a partition that occur at least twice. See Section 3.3.1 of [2].
Matching statistic: St001092
(load all 5 compositions to match this statistic)
Mapping
St001092: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => 0 = 1 - 1
[2]
 => 1 = 2 - 1
[1,1]
 => 0 = 1 - 1
[3]
 => 0 = 1 - 1
[2,1]
 => 1 = 2 - 1
[1,1,1]
 => 0 = 1 - 1
[4]
 => 1 = 2 - 1
[3,1]
 => 0 = 1 - 1
[2,2]
 => 1 = 2 - 1
[2,1,1]
 => 1 = 2 - 1
[1,1,1,1]
 => 0 = 1 - 1
[5]
 => 0 = 1 - 1
[4,1]
 => 1 = 2 - 1
[3,2]
 => 1 = 2 - 1
[3,1,1]
 => 0 = 1 - 1
[2,2,1]
 => 1 = 2 - 1
[2,1,1,1]
 => 1 = 2 - 1
[1,1,1,1,1]
 => 0 = 1 - 1
[6]
 => 1 = 2 - 1
[5,1]
 => 0 = 1 - 1
[4,2]
 => 2 = 3 - 1
[4,1,1]
 => 1 = 2 - 1
[3,3]
 => 0 = 1 - 1
[3,2,1]
 => 1 = 2 - 1
[3,1,1,1]
 => 0 = 1 - 1
[2,2,2]
 => 1 = 2 - 1
[2,2,1,1]
 => 1 = 2 - 1
[2,1,1,1,1]
 => 1 = 2 - 1
[1,1,1,1,1,1]
 => 0 = 1 - 1
Description
The number of distinct even parts of a partition. See Section 3.3.1 of [1].
Matching statistic: St000386
(load all 95 compositions to match this statistic)
Mapping
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St000386: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => [1,0,1,0]
 => 0 = 1 - 1
[2]
 => [1,1,0,0,1,0]
 => 1 = 2 - 1
[1,1]
 => [1,0,1,1,0,0]
 => 0 = 1 - 1
[3]
 => [1,1,1,0,0,0,1,0]
 => 1 = 2 - 1
[2,1]
 => [1,0,1,0,1,0]
 => 0 = 1 - 1
[1,1,1]
 => [1,0,1,1,1,0,0,0]
 => 0 = 1 - 1
[4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 1 = 2 - 1
[3,1]
 => [1,1,0,1,0,0,1,0]
 => 1 = 2 - 1
[2,2]
 => [1,1,0,0,1,1,0,0]
 => 1 = 2 - 1
[2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 0 = 1 - 1
[1,1,1,1]
 => [1,0,1,1,1,1,0,0,0,0]
 => 0 = 1 - 1
[5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 1 = 2 - 1
[4,1]
 => [1,1,1,0,1,0,0,0,1,0]
 => 1 = 2 - 1
[3,2]
 => [1,1,0,0,1,0,1,0]
 => 1 = 2 - 1
[3,1,1]
 => [1,0,1,1,0,0,1,0]
 => 1 = 2 - 1
[2,2,1]
 => [1,0,1,0,1,1,0,0]
 => 0 = 1 - 1
[2,1,1,1]
 => [1,0,1,1,1,0,1,0,0,0]
 => 0 = 1 - 1
[1,1,1,1,1]
 => [1,0,1,1,1,1,1,0,0,0,0,0]
 => 0 = 1 - 1
[6]
 => [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
 => 1 = 2 - 1
[5,1]
 => [1,1,1,1,0,1,0,0,0,0,1,0]
 => 1 = 2 - 1
[4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 2 = 3 - 1
[4,1,1]
 => [1,1,0,1,1,0,0,0,1,0]
 => 1 = 2 - 1
[3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 1 = 2 - 1
[3,2,1]
 => [1,0,1,0,1,0,1,0]
 => 0 = 1 - 1
[3,1,1,1]
 => [1,0,1,1,1,0,0,1,0,0]
 => 1 = 2 - 1
[2,2,2]
 => [1,1,0,0,1,1,1,0,0,0]
 => 1 = 2 - 1
[2,2,1,1]
 => [1,0,1,1,0,1,1,0,0,0]
 => 0 = 1 - 1
[2,1,1,1,1]
 => [1,0,1,1,1,1,0,1,0,0,0,0]
 => 0 = 1 - 1
[1,1,1,1,1,1]
 => [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
 => 0 = 1 - 1
Description
The number of factors DDU in a Dyck path.
Matching statistic: St001037
(load all 48 compositions to match this statistic)
Mapping
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001037: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => [1,0,1,0]
 => 0 = 1 - 1
[2]
 => [1,1,0,0,1,0]
 => 0 = 1 - 1
[1,1]
 => [1,0,1,1,0,0]
 => 1 = 2 - 1
[3]
 => [1,1,1,0,0,0,1,0]
 => 0 = 1 - 1
[2,1]
 => [1,0,1,0,1,0]
 => 0 = 1 - 1
[1,1,1]
 => [1,0,1,1,1,0,0,0]
 => 1 = 2 - 1
[4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 0 = 1 - 1
[3,1]
 => [1,1,0,1,0,0,1,0]
 => 0 = 1 - 1
[2,2]
 => [1,1,0,0,1,1,0,0]
 => 1 = 2 - 1
[2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[1,1,1,1]
 => [1,0,1,1,1,1,0,0,0,0]
 => 1 = 2 - 1
[5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 0 = 1 - 1
[4,1]
 => [1,1,1,0,1,0,0,0,1,0]
 => 0 = 1 - 1
[3,2]
 => [1,1,0,0,1,0,1,0]
 => 0 = 1 - 1
[3,1,1]
 => [1,0,1,1,0,0,1,0]
 => 1 = 2 - 1
[2,2,1]
 => [1,0,1,0,1,1,0,0]
 => 1 = 2 - 1
[2,1,1,1]
 => [1,0,1,1,1,0,1,0,0,0]
 => 1 = 2 - 1
[1,1,1,1,1]
 => [1,0,1,1,1,1,1,0,0,0,0,0]
 => 1 = 2 - 1
[6]
 => [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
 => 0 = 1 - 1
[5,1]
 => [1,1,1,1,0,1,0,0,0,0,1,0]
 => 0 = 1 - 1
[4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 1 = 2 - 1
[4,1,1]
 => [1,1,0,1,1,0,0,0,1,0]
 => 0 = 1 - 1
[3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 1 = 2 - 1
[3,2,1]
 => [1,0,1,0,1,0,1,0]
 => 0 = 1 - 1
[3,1,1,1]
 => [1,0,1,1,1,0,0,1,0,0]
 => 2 = 3 - 1
[2,2,2]
 => [1,1,0,0,1,1,1,0,0,0]
 => 1 = 2 - 1
[2,2,1,1]
 => [1,0,1,1,0,1,1,0,0,0]
 => 1 = 2 - 1
[2,1,1,1,1]
 => [1,0,1,1,1,1,0,1,0,0,0,0]
 => 1 = 2 - 1
[1,1,1,1,1,1]
 => [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
 => 1 = 2 - 1
Description
The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path.
Matching statistic: St000201
(load all 21 compositions to match this statistic)
Mapping
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00029: Dyck paths —to binary tree: left tree, up step, right tree, down step⟶ Binary trees
St000201: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => [1,0,1,0]
 => [[.,.],.]
 => 1
[2]
 => [1,1,0,0,1,0]
 => [[.,[.,.]],.]
 => 1
[1,1]
 => [1,0,1,1,0,0]
 => [[.,.],[.,.]]
 => 2
[3]
 => [1,1,1,0,0,0,1,0]
 => [[.,[.,[.,.]]],.]
 => 1
[2,1]
 => [1,0,1,0,1,0]
 => [[[.,.],.],.]
 => 1
[1,1,1]
 => [1,0,1,1,1,0,0,0]
 => [[.,.],[.,[.,.]]]
 => 2
[4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [[.,[.,[.,[.,.]]]],.]
 => 1
[3,1]
 => [1,1,0,1,0,0,1,0]
 => [[.,[[.,.],.]],.]
 => 1
[2,2]
 => [1,1,0,0,1,1,0,0]
 => [[.,[.,.]],[.,.]]
 => 2
[2,1,1]
 => [1,0,1,1,0,1,0,0]
 => [[.,.],[[.,.],.]]
 => 2
[1,1,1,1]
 => [1,0,1,1,1,1,0,0,0,0]
 => [[.,.],[.,[.,[.,.]]]]
 => 2
[5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [[.,[.,[.,[.,[.,.]]]]],.]
 => 1
[4,1]
 => [1,1,1,0,1,0,0,0,1,0]
 => [[.,[.,[[.,.],.]]],.]
 => 1
[3,2]
 => [1,1,0,0,1,0,1,0]
 => [[[.,[.,.]],.],.]
 => 1
[3,1,1]
 => [1,0,1,1,0,0,1,0]
 => [[[.,.],[.,.]],.]
 => 2
[2,2,1]
 => [1,0,1,0,1,1,0,0]
 => [[[.,.],.],[.,.]]
 => 2
[2,1,1,1]
 => [1,0,1,1,1,0,1,0,0,0]
 => [[.,.],[.,[[.,.],.]]]
 => 2
[1,1,1,1,1]
 => [1,0,1,1,1,1,1,0,0,0,0,0]
 => [[.,.],[.,[.,[.,[.,.]]]]]
 => 2
[6]
 => [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
 => [[.,[.,[.,[.,[.,[.,.]]]]]],.]
 => 1
[5,1]
 => [1,1,1,1,0,1,0,0,0,0,1,0]
 => [[.,[.,[.,[[.,.],.]]]],.]
 => 1
[4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => [[.,[[.,[.,.]],.]],.]
 => 1
[4,1,1]
 => [1,1,0,1,1,0,0,0,1,0]
 => [[.,[[.,.],[.,.]]],.]
 => 2
[3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [[.,[.,[.,.]]],[.,.]]
 => 2
[3,2,1]
 => [1,0,1,0,1,0,1,0]
 => [[[[.,.],.],.],.]
 => 1
[3,1,1,1]
 => [1,0,1,1,1,0,0,1,0,0]
 => [[.,.],[[.,[.,.]],.]]
 => 2
[2,2,2]
 => [1,1,0,0,1,1,1,0,0,0]
 => [[.,[.,.]],[.,[.,.]]]
 => 2
[2,2,1,1]
 => [1,0,1,1,0,1,1,0,0,0]
 => [[.,.],[[.,.],[.,.]]]
 => 3
[2,1,1,1,1]
 => [1,0,1,1,1,1,0,1,0,0,0,0]
 => [[.,.],[.,[.,[[.,.],.]]]]
 => 2
[1,1,1,1,1,1]
 => [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
 => [[.,.],[.,[.,[.,[.,[.,.]]]]]]
 => 2
Description
The number of leaf nodes in a binary tree. Equivalently, the number of cherries [1] in the complete binary tree. The number of binary trees of size $n$, at least $1$, with exactly one leaf node for is $2^{n-1}$, see [2]. The number of binary tree of size $n$, at least $3$, with exactly two leaf nodes is $n(n+1)2^{n-2}$, see [3].
Matching statistic: St000196
(load all 20 compositions to match this statistic)
Mapping
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00029: Dyck paths —to binary tree: left tree, up step, right tree, down step⟶ Binary trees
St000196: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => [1,0,1,0]
 => [[.,.],.]
 => 0 = 1 - 1
[2]
 => [1,1,0,0,1,0]
 => [[.,[.,.]],.]
 => 0 = 1 - 1
[1,1]
 => [1,0,1,1,0,0]
 => [[.,.],[.,.]]
 => 1 = 2 - 1
[3]
 => [1,1,1,0,0,0,1,0]
 => [[.,[.,[.,.]]],.]
 => 0 = 1 - 1
[2,1]
 => [1,0,1,0,1,0]
 => [[[.,.],.],.]
 => 0 = 1 - 1
[1,1,1]
 => [1,0,1,1,1,0,0,0]
 => [[.,.],[.,[.,.]]]
 => 1 = 2 - 1
[4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [[.,[.,[.,[.,.]]]],.]
 => 0 = 1 - 1
[3,1]
 => [1,1,0,1,0,0,1,0]
 => [[.,[[.,.],.]],.]
 => 0 = 1 - 1
[2,2]
 => [1,1,0,0,1,1,0,0]
 => [[.,[.,.]],[.,.]]
 => 1 = 2 - 1
[2,1,1]
 => [1,0,1,1,0,1,0,0]
 => [[.,.],[[.,.],.]]
 => 1 = 2 - 1
[1,1,1,1]
 => [1,0,1,1,1,1,0,0,0,0]
 => [[.,.],[.,[.,[.,.]]]]
 => 1 = 2 - 1
[5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [[.,[.,[.,[.,[.,.]]]]],.]
 => 0 = 1 - 1
[4,1]
 => [1,1,1,0,1,0,0,0,1,0]
 => [[.,[.,[[.,.],.]]],.]
 => 0 = 1 - 1
[3,2]
 => [1,1,0,0,1,0,1,0]
 => [[[.,[.,.]],.],.]
 => 0 = 1 - 1
[3,1,1]
 => [1,0,1,1,0,0,1,0]
 => [[[.,.],[.,.]],.]
 => 1 = 2 - 1
[2,2,1]
 => [1,0,1,0,1,1,0,0]
 => [[[.,.],.],[.,.]]
 => 1 = 2 - 1
[2,1,1,1]
 => [1,0,1,1,1,0,1,0,0,0]
 => [[.,.],[.,[[.,.],.]]]
 => 1 = 2 - 1
[1,1,1,1,1]
 => [1,0,1,1,1,1,1,0,0,0,0,0]
 => [[.,.],[.,[.,[.,[.,.]]]]]
 => 1 = 2 - 1
[6]
 => [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
 => [[.,[.,[.,[.,[.,[.,.]]]]]],.]
 => 0 = 1 - 1
[5,1]
 => [1,1,1,1,0,1,0,0,0,0,1,0]
 => [[.,[.,[.,[[.,.],.]]]],.]
 => 0 = 1 - 1
[4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => [[.,[[.,[.,.]],.]],.]
 => 0 = 1 - 1
[4,1,1]
 => [1,1,0,1,1,0,0,0,1,0]
 => [[.,[[.,.],[.,.]]],.]
 => 1 = 2 - 1
[3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [[.,[.,[.,.]]],[.,.]]
 => 1 = 2 - 1
[3,2,1]
 => [1,0,1,0,1,0,1,0]
 => [[[[.,.],.],.],.]
 => 0 = 1 - 1
[3,1,1,1]
 => [1,0,1,1,1,0,0,1,0,0]
 => [[.,.],[[.,[.,.]],.]]
 => 1 = 2 - 1
[2,2,2]
 => [1,1,0,0,1,1,1,0,0,0]
 => [[.,[.,.]],[.,[.,.]]]
 => 1 = 2 - 1
[2,2,1,1]
 => [1,0,1,1,0,1,1,0,0,0]
 => [[.,.],[[.,.],[.,.]]]
 => 2 = 3 - 1
[2,1,1,1,1]
 => [1,0,1,1,1,1,0,1,0,0,0,0]
 => [[.,.],[.,[.,[[.,.],.]]]]
 => 1 = 2 - 1
[1,1,1,1,1,1]
 => [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
 => [[.,.],[.,[.,[.,[.,[.,.]]]]]]
 => 1 = 2 - 1
Description
The number of occurrences of the contiguous pattern {{{[[.,.],[.,.]]}}} in a binary tree. Equivalently, this is the number of branches in the tree, i.e. the number of nodes with two children. Binary trees avoiding this pattern are counted by $2^{n-2}$.
Matching statistic: St001115
(load all 9 compositions to match this statistic)
Mapping
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St001115: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => [1,0,1,0]
 => [2,1] => 0 = 1 - 1
[2]
 => [1,1,0,0,1,0]
 => [3,1,2] => 0 = 1 - 1
[1,1]
 => [1,0,1,1,0,0]
 => [2,3,1] => 1 = 2 - 1
[3]
 => [1,1,1,0,0,0,1,0]
 => [4,1,2,3] => 0 = 1 - 1
[2,1]
 => [1,0,1,0,1,0]
 => [3,2,1] => 1 = 2 - 1
[1,1,1]
 => [1,0,1,1,1,0,0,0]
 => [2,3,4,1] => 0 = 1 - 1
[4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [5,1,2,3,4] => 0 = 1 - 1
[3,1]
 => [1,1,0,1,0,0,1,0]
 => [4,2,1,3] => 1 = 2 - 1
[2,2]
 => [1,1,0,0,1,1,0,0]
 => [3,4,1,2] => 1 = 2 - 1
[2,1,1]
 => [1,0,1,1,0,1,0,0]
 => [3,2,4,1] => 0 = 1 - 1
[1,1,1,1]
 => [1,0,1,1,1,1,0,0,0,0]
 => [2,3,4,5,1] => 1 = 2 - 1
[5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [6,1,2,3,4,5] => 0 = 1 - 1
[4,1]
 => [1,1,1,0,1,0,0,0,1,0]
 => [5,2,1,3,4] => 1 = 2 - 1
[3,2]
 => [1,1,0,0,1,0,1,0]
 => [4,3,1,2] => 1 = 2 - 1
[3,1,1]
 => [1,0,1,1,0,0,1,0]
 => [4,2,3,1] => 0 = 1 - 1
[2,2,1]
 => [1,0,1,0,1,1,0,0]
 => [3,4,2,1] => 1 = 2 - 1
[2,1,1,1]
 => [1,0,1,1,1,0,1,0,0,0]
 => [3,2,4,5,1] => 1 = 2 - 1
[1,1,1,1,1]
 => [1,0,1,1,1,1,1,0,0,0,0,0]
 => [2,3,4,5,6,1] => 0 = 1 - 1
[6]
 => [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
 => [7,1,2,3,4,5,6] => 0 = 1 - 1
[5,1]
 => [1,1,1,1,0,1,0,0,0,0,1,0]
 => [6,2,1,3,4,5] => 1 = 2 - 1
[4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => [5,3,1,2,4] => 1 = 2 - 1
[4,1,1]
 => [1,1,0,1,1,0,0,0,1,0]
 => [5,2,3,1,4] => 0 = 1 - 1
[3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [4,5,1,2,3] => 1 = 2 - 1
[3,2,1]
 => [1,0,1,0,1,0,1,0]
 => [4,3,2,1] => 1 = 2 - 1
[3,1,1,1]
 => [1,0,1,1,1,0,0,1,0,0]
 => [4,2,3,5,1] => 1 = 2 - 1
[2,2,2]
 => [1,1,0,0,1,1,1,0,0,0]
 => [3,4,5,1,2] => 0 = 1 - 1
[2,2,1,1]
 => [1,0,1,1,0,1,1,0,0,0]
 => [3,4,2,5,1] => 2 = 3 - 1
[2,1,1,1,1]
 => [1,0,1,1,1,1,0,1,0,0,0,0]
 => [3,2,4,5,6,1] => 0 = 1 - 1
[1,1,1,1,1,1]
 => [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
 => [2,3,4,5,6,7,1] => 1 = 2 - 1
Description
The number of even descents of a permutation.
Matching statistic: St000035
(load all 9 compositions to match this statistic)
Mapping
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000035: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => [1,0,1,0]
 => [1,1,0,1,0,0]
 => [2,3,1] => 1
[2]
 => [1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => [3,1,4,2] => 2
[1,1]
 => [1,0,1,1,0,0]
 => [1,1,0,1,1,0,0,0]
 => [2,4,1,3] => 1
[3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [4,1,2,5,3] => 2
[2,1]
 => [1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [2,3,4,1] => 1
[1,1,1]
 => [1,0,1,1,1,0,0,0]
 => [1,1,0,1,1,1,0,0,0,0]
 => [2,5,1,3,4] => 1
[4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,1,1,1,0,0,0,0,1,0,0]
 => [5,1,2,3,6,4] => 2
[3,1]
 => [1,1,0,1,0,0,1,0]
 => [1,1,1,0,1,0,0,1,0,0]
 => [3,4,1,5,2] => 2
[2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [3,1,5,2,4] => 2
[2,1,1]
 => [1,0,1,1,0,1,0,0]
 => [1,1,0,1,1,0,1,0,0,0]
 => [2,4,5,1,3] => 1
[1,1,1,1]
 => [1,0,1,1,1,1,0,0,0,0]
 => [1,1,0,1,1,1,1,0,0,0,0,0]
 => [2,6,1,3,4,5] => 1
[5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
 => [6,1,2,3,4,7,5] => 2
[4,1]
 => [1,1,1,0,1,0,0,0,1,0]
 => [1,1,1,1,0,1,0,0,0,1,0,0]
 => [4,5,1,2,6,3] => 2
[3,2]
 => [1,1,0,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [3,1,4,5,2] => 2
[3,1,1]
 => [1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [2,4,1,5,3] => 2
[2,2,1]
 => [1,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => [2,3,5,1,4] => 1
[2,1,1,1]
 => [1,0,1,1,1,0,1,0,0,0]
 => [1,1,0,1,1,1,0,1,0,0,0,0]
 => [2,5,6,1,3,4] => 1
[1,1,1,1,1]
 => [1,0,1,1,1,1,1,0,0,0,0,0]
 => [1,1,0,1,1,1,1,1,0,0,0,0,0,0]
 => [2,7,1,3,4,5,6] => 1
[6]
 => [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
 => [1,1,1,1,1,1,1,0,0,0,0,0,0,1,0,0]
 => [7,1,2,3,4,5,8,6] => 2
[5,1]
 => [1,1,1,1,0,1,0,0,0,0,1,0]
 => [1,1,1,1,1,0,1,0,0,0,0,1,0,0]
 => [5,6,1,2,3,7,4] => 2
[4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,1,1,1,0,0,1,0,0,1,0,0]
 => [4,1,5,2,6,3] => 3
[4,1,1]
 => [1,1,0,1,1,0,0,0,1,0]
 => [1,1,1,0,1,1,0,0,0,1,0,0]
 => [3,5,1,2,6,4] => 2
[3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,1,1,0,0,0,1,1,0,0,0]
 => [4,1,2,6,3,5] => 2
[3,2,1]
 => [1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [2,3,4,5,1] => 1
[3,1,1,1]
 => [1,0,1,1,1,0,0,1,0,0]
 => [1,1,0,1,1,1,0,0,1,0,0,0]
 => [2,5,1,6,3,4] => 2
[2,2,2]
 => [1,1,0,0,1,1,1,0,0,0]
 => [1,1,1,0,0,1,1,1,0,0,0,0]
 => [3,1,6,2,4,5] => 2
[2,2,1,1]
 => [1,0,1,1,0,1,1,0,0,0]
 => [1,1,0,1,1,0,1,1,0,0,0,0]
 => [2,4,6,1,3,5] => 1
[2,1,1,1,1]
 => [1,0,1,1,1,1,0,1,0,0,0,0]
 => [1,1,0,1,1,1,1,0,1,0,0,0,0,0]
 => [2,6,7,1,3,4,5] => 1
[1,1,1,1,1,1]
 => [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
 => [1,1,0,1,1,1,1,1,1,0,0,0,0,0,0,0]
 => [2,8,1,3,4,5,6,7] => 1
Description
The number of left outer peaks of a permutation. A left outer peak in a permutation $w = [w_1,..., w_n]$ is either a position $i$ such that $w_{i-1} < w_i > w_{i+1}$ or $1$ if $w_1 > w_2$. In other words, it is a peak in the word $[0,w_1,..., w_n]$. This appears in [1, def.3.1]. The joint distribution with [[St000366]] is studied in [3], where left outer peaks are called ''exterior peaks''.
Matching statistic: St000068
(load all 2 compositions to match this statistic)
Mapping
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00034: Dyck paths —to binary tree: up step, left tree, down step, right tree⟶ Binary trees
Mp00013: Binary trees —to poset⟶ Posets
St000068: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => [1,0,1,0]
 => [.,[.,.]]
 => ([(0,1)],2)
 => 1
[2]
 => [1,1,0,0,1,0]
 => [[.,.],[.,.]]
 => ([(0,2),(1,2)],3)
 => 2
[1,1]
 => [1,0,1,1,0,0]
 => [.,[[.,.],.]]
 => ([(0,2),(2,1)],3)
 => 1
[3]
 => [1,1,1,0,0,0,1,0]
 => [[[.,.],.],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2
[2,1]
 => [1,0,1,0,1,0]
 => [.,[.,[.,.]]]
 => ([(0,2),(2,1)],3)
 => 1
[1,1,1]
 => [1,0,1,1,1,0,0,0]
 => [.,[[[.,.],.],.]]
 => ([(0,3),(2,1),(3,2)],4)
 => 1
[4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [[[[.,.],.],.],[.,.]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 2
[3,1]
 => [1,1,0,1,0,0,1,0]
 => [[.,[.,.]],[.,.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2
[2,2]
 => [1,1,0,0,1,1,0,0]
 => [[.,.],[[.,.],.]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2
[2,1,1]
 => [1,0,1,1,0,1,0,0]
 => [.,[[.,[.,.]],.]]
 => ([(0,3),(2,1),(3,2)],4)
 => 1
[1,1,1,1]
 => [1,0,1,1,1,1,0,0,0,0]
 => [.,[[[[.,.],.],.],.]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 1
[5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [[[[[.,.],.],.],.],[.,.]]
 => ([(0,5),(1,4),(2,5),(3,2),(4,3)],6)
 => 2
[4,1]
 => [1,1,1,0,1,0,0,0,1,0]
 => [[[.,[.,.]],.],[.,.]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 2
[3,2]
 => [1,1,0,0,1,0,1,0]
 => [[.,.],[.,[.,.]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2
[3,1,1]
 => [1,0,1,1,0,0,1,0]
 => [.,[[.,.],[.,.]]]
 => ([(0,3),(1,3),(3,2)],4)
 => 2
[2,2,1]
 => [1,0,1,0,1,1,0,0]
 => [.,[.,[[.,.],.]]]
 => ([(0,3),(2,1),(3,2)],4)
 => 1
[2,1,1,1]
 => [1,0,1,1,1,0,1,0,0,0]
 => [.,[[[.,[.,.]],.],.]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 1
[1,1,1,1,1]
 => [1,0,1,1,1,1,1,0,0,0,0,0]
 => [.,[[[[[.,.],.],.],.],.]]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 1
[6]
 => [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
 => [[[[[[.,.],.],.],.],.],[.,.]]
 => ([(0,6),(1,5),(2,6),(3,4),(4,2),(5,3)],7)
 => 2
[5,1]
 => [1,1,1,1,0,1,0,0,0,0,1,0]
 => [[[[.,[.,.]],.],.],[.,.]]
 => ([(0,5),(1,4),(2,5),(3,2),(4,3)],6)
 => 2
[4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => [[[.,.],[.,.]],[.,.]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => 3
[4,1,1]
 => [1,1,0,1,1,0,0,0,1,0]
 => [[.,[[.,.],.]],[.,.]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 2
[3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [[[.,.],.],[[.,.],.]]
 => ([(0,3),(1,2),(2,4),(3,4)],5)
 => 2
[3,2,1]
 => [1,0,1,0,1,0,1,0]
 => [.,[.,[.,[.,.]]]]
 => ([(0,3),(2,1),(3,2)],4)
 => 1
[3,1,1,1]
 => [1,0,1,1,1,0,0,1,0,0]
 => [.,[[[.,.],[.,.]],.]]
 => ([(0,4),(1,4),(2,3),(4,2)],5)
 => 2
[2,2,2]
 => [1,1,0,0,1,1,1,0,0,0]
 => [[.,.],[[[.,.],.],.]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 2
[2,2,1,1]
 => [1,0,1,1,0,1,1,0,0,0]
 => [.,[[.,[[.,.],.]],.]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 1
[2,1,1,1,1]
 => [1,0,1,1,1,1,0,1,0,0,0,0]
 => [.,[[[[.,[.,.]],.],.],.]]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 1
[1,1,1,1,1,1]
 => [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
 => [.,[[[[[[.,.],.],.],.],.],.]]
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => 1
Description
The number of minimal elements in a poset.
The following 402 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000071The number of maximal chains in a poset. St000251The number of nonsingleton blocks of a set partition. St000254The nesting number of a set partition. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000340The number of non-final maximal constant sub-paths of length greater than one. St000527The width of the poset. St000568The hook number of a binary tree. St000647The number of big descents of a permutation. St000742The number of big ascents of a permutation after prepending zero. St000884The number of isolated descents of a permutation. St000920The logarithmic height of a Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001151The number of blocks with odd minimum. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001732The number of peaks visible from the left. St001733The number of weak left to right maxima of a Dyck path. St000052The number of valleys of a Dyck path not on the x-axis. 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. St000214The number of adjacencies of a permutation. St000291The number of descents of a binary word. St000292The number of ascents of a binary word. St000356The number of occurrences of the pattern 13-2. St000390The number of runs of ones in a binary word. St000523The number of 2-protected nodes of a rooted tree. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000628The balance of a binary word. St000632The jump number of the poset. St000660The number of rises of length at least 3 of a Dyck path. St000661The number of rises of length 3 of a Dyck path. St000665The number of rafts of a permutation. St000768The number of peaks in an integer composition. St000779The tier of a permutation. St000783The side length of the largest staircase partition fitting into a partition. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St001022Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001394The genus of a permutation. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001712The number of natural descents of a standard Young tableau. St001801Half the number of preimage-image pairs of different parity in a permutation. St001839The number of excedances of a set partition. St001840The number of descents of a set partition. St000662The staircase size of the code of a permutation. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001741The largest integer such that all patterns of this size are contained in the permutation. St000353The number of inner valleys of a permutation. St000486The number of cycles of length at least 3 of a permutation. St000710The number of big deficiencies of a permutation. St000836The number of descents of distance 2 of a permutation. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001114The number of odd descents of a permutation. St001469The holeyness of a permutation. St001737The number of descents of type 2 in a permutation. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St000659The number of rises of length at least 2 of a Dyck path. St000023The number of inner peaks of a permutation. St000021The number of descents of a permutation. St000069The number of maximal elements of a poset. St000120The number of left tunnels of a Dyck path. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000354The number of recoils of a permutation. St000396The register function (or Horton-Strahler number) of a binary tree. St000834The number of right outer peaks of a permutation. St000862The number of parts of the shifted shape of a permutation. St000864The number of circled entries of the shifted recording tableau of a permutation. St000919The number of maximal left branches of a binary tree. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001235The global dimension of the corresponding Comp-Nakayama algebra. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001760The number of prefix or suffix reversals needed to sort a permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St000325The width of the tree associated to a permutation. St000360The number of occurrences of the pattern 32-1. St000397The Strahler number of a rooted tree. St000470The number of runs in a permutation. St000624The normalized sum of the minimal distances to a greater element. St000646The number of big ascents of a permutation. St000711The number of big exceedences of a permutation. St000731The number of double exceedences of a permutation. St000732The number of double deficiencies of a permutation. St000754The Grundy value for the game of removing nestings in a perfect matching. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. 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. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001728The number of invisible descents of a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001859The number of factors of the Stanley symmetric function associated with a permutation. St000355The number of occurrences of the pattern 21-3. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St001052The length of the exterior of a permutation. St001096The size of the overlap set of a permutation. St001729The number of visible descents of a permutation. St001928The number of non-overlapping descents in a permutation. St000007The number of saliances of the permutation. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000443The number of long tunnels of a Dyck path. 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. St001007Number of simple modules with projective dimension 1 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. 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. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001814The number of partitions interlacing the given partition. St001955The number of natural descents for set-valued two row standard Young tableaux. St001960The number of descents of a permutation minus one if its first entry is not one. St000006The dinv of a Dyck path. St000013The height of a Dyck path. St000015The number of peaks of a Dyck path. St000062The length of the longest increasing subsequence of the permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000166The depth minus 1 of an ordered tree. St000199The column of the unique '1' in the last row of the alternating sign matrix. St000200The row of the unique '1' in the last column of the alternating sign matrix. St000239The number of small weak excedances. St000288The number of ones in a binary word. St000308The height of the tree associated to a permutation. St000314The number of left-to-right-maxima of a permutation. St000335The difference of lower and upper interactions. St000378The diagonal inversion number of an integer partition. St000381The largest part of an integer composition. 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. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000626The minimal period of a binary word. St000638The number of up-down runs of a permutation. St000678The number of up steps after the last double rise of a Dyck path. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000701The protection number of a binary tree. St000720The size of the largest partition in the oscillating tableau corresponding to the perfect matching. St000733The row containing the largest entry of a standard tableau. St000758The length of the longest staircase fitting into an integer composition. St000767The number of runs in an integer composition. St000808The number of up steps of the associated bargraph. St000820The number of compositions obtained by rotating the composition. St000838The number of terminal right-hand endpoints when the vertices are written in order. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St000982The length of the longest constant subword. St000990The first ascent of a permutation. St000991The number of right-to-left minima of a permutation. 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. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001044The number of pairs whose larger element is at most one more than half the size of the perfect matching. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001165Number of simple modules with even projective dimension 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. 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. 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. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. 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. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001372The length of a longest cyclic run of ones of a binary word. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001471The magnitude of a Dyck path. St001481The minimal height of a peak of a Dyck path. St001486The number of corners of the ribbon associated with an integer composition. St001487The number of inner corners of a skew partition. St001530The depth of a Dyck path. St001589The nesting number of a perfect matching. St001597The Frobenius rank of a skew partition. St001665The number of pure excedances of a permutation. 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. St000252The number of nodes of degree 3 of a binary tree. St000542The number of left-to-right-minima of a permutation. St000873The aix statistic of a permutation. 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$. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to 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. St001948The number of augmented double ascents of a permutation. St000259The diameter of a connected graph. St000619The number of cyclic descents of a permutation. St001220The width of a permutation. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000455The second largest eigenvalue of a graph if it is integral. St001568The smallest positive integer that does not appear twice in the partition. St001569The maximal modular displacement of a permutation. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St000706The product of the factorials of the multiplicities of an integer partition. St000668The least common multiple of the parts of the partition. St000444The length of the maximal rise of a Dyck path. St000939The number of characters of the symmetric group whose value on the partition is positive. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St000061The number of nodes on the left branch of a binary tree. St000326The position of the first one in a binary word after appending a 1 at the end. St000454The largest eigenvalue of a graph if it is integral. St000504The cardinality of the first block of a set partition. St000654The first descent of a permutation. St000675The number of centered multitunnels of a Dyck path. St000702The number of weak deficiencies of a permutation. St000708The product of the parts of an integer partition. St000823The number of unsplittable factors of the set partition. St000898The number of maximal entries in the last diagonal of the monotone triangle. St000933The number of multipartitions of sizes given by an integer partition. St001062The maximal size of a block of a set partition. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001435The number of missing boxes in the first row. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001462The number of factors of a standard tableaux under concatenation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St000764The number of strong records in an integer composition. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St000937The number of positive values of the symmetric group character corresponding to the partition. St000010The length of the partition. St000144The pyramid weight of the Dyck path. St000147The largest part of an integer partition. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000321The number of integer partitions of n that are dominated by an integer partition. St000345The number of refinements of a partition. St000346The number of coarsenings of a partition. St000384The maximal part of the shifted composition of an integer partition. St000439The position of the first down step of a Dyck path. St000531The leading coefficient of the rook polynomial of an integer partition. St000667The greatest common divisor of the parts of the partition. St000744The length of the path to the largest entry in a standard Young tableau. St000784The maximum of the length and the largest part of the integer partition. 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. St000935The number of ordered refinements of an integer partition. 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}$. St000993The multiplicity of the largest part of an integer partition. St001009Number of indecomposable injective modules with projective dimension g when g is the global 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. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over 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. St001389The number of partitions of the same length below the given integer partition. St001488The number of corners of a skew partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001571The Cartan determinant of the integer partition. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. St001885The number of binary words with the same proper border set. St000805The number of peaks of the associated bargraph. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001432The order dimension of the partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St000761The number of ascents in an integer composition. St000807The sum of the heights of the valleys of the associated bargraph. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001520The number of strict 3-descents. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000460The hook length of the last cell along the main diagonal of an integer partition. St000870The product of the hook lengths of the diagonal cells in an integer partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001933The largest multiplicity of a part in an integer partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St000383The last part of an integer composition. St000741The Colin de Verdière graph invariant. St001249Sum of the odd parts of a partition. St001360The number of covering relations in Young's lattice below a partition. St001378The product of the cohook lengths of the integer partition. St001527The cyclic permutation representation number of an integer partition. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001607The number of coloured graphs 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. St000260The radius of a connected graph. St000285The size of the preimage of the map 'to inverse des composition' from Parking functions to Integer compositions. St000456The monochromatic index of a connected graph. St001118The acyclic chromatic index of a graph. 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. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000782The indicator function of whether a given perfect matching is an L & P matching. St001128The exponens consonantiae of a partition. St000973The length of the boundary of an ordered tree. St000975The length of the boundary minus the length of the trunk of an ordered tree. St000681The Grundy value of Chomp on Ferrers diagrams. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000707The product of the factorials of the parts. 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. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000817The sum of the entries in the column specified by the composition of the change of basis matrix from dual immaculate quasisymmetric functions to monomial quasisymmetric functions. St000818The sum of the entries in the column specified by the composition of the change of basis matrix from quasisymmetric Schur functions to monomial quasisymmetric functions. St001564The value of the forgotten symmetric functions when all variables set to 1. St001602The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on endofunctions. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. St000618The number of self-evacuating tableaux of given shape. St000781The number of proper colouring schemes of a Ferrers diagram. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001162The minimum jump of a permutation. 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. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. 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. 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. St000461The rix statistic of a permutation. St000613The number of occurrences of the pattern {{1,3},{2}} such that 2 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000649The number of 3-excedences of a permutation. St000284The Plancherel distribution on integer partitions. St000352The Elizalde-Pak rank of a permutation. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000929The constant term of the character polynomial of an integer partition. St000054The first entry of the permutation. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001438The number of missing boxes of a skew partition. St001816Eigenvalues of the top-to-random operator acting on a simple module. St000090The variation of a composition. St000091The descent variation of a composition. St000491The number of inversions of a set partition. St000492The rob statistic of a set partition. St000497The lcb statistic of a set partition. St000498The lcs statistic of a set partition. St000562The number of internal points of a set partition. St000565The major index of a set partition. St000567The sum of the products of all pairs of parts. St000577The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. St000597The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, (2,3) are consecutive in a block. St000614The number of occurrences of the pattern {{1},{2,3}} such that 1 is minimal, 3 is maximal, (2,3) are consecutive in a block. St000695The number of blocks in the first part of the atomic decomposition of a set 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. 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. 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)$. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001722The number of minimal chains with small intervals between a binary word and the top element. St001896The number of right descents of a signed permutations. St001904The length of the initial strictly increasing segment of a parking function. St001935The number of ascents in a parking function. St001946The number of descents in a parking function. St000075The orbit size of a standard tableau under promotion. St000089The absolute variation of a composition. St000365The number of double ascents of a permutation. St000522The number of 1-protected nodes of a rooted tree. St000589The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal, (2,3) are consecutive in a block. St000606The number of occurrences of the pattern {{1},{2,3}} such that 1,3 are maximal, (2,3) are consecutive in a block. St000611The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal. St000709The number of occurrences of 14-2-3 or 14-3-2. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000839The largest opener of a set partition. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001557The number of inversions of the second entry of a permutation. St001784The minimum of the smallest closer and the second element of the block containing 1 in a set partition. St001867The number of alignments of type EN of a signed permutation. St001868The number of alignments of type NE of a signed permutation. St000230Sum of the minimal elements of the blocks of a set partition. St000521The number of distinct subtrees of an ordered tree. St001516The number of cyclic bonds of a permutation. St000735The last entry on the main diagonal of a standard tableau. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000736The last entry in the first row of a semistandard tableau. St001060The distinguishing index of a graph. St001208The number of connected components of the quiver of $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra $A$ of $K[x]/(x^n)$. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000112The sum of the entries reduced by the index of their row in a semistandard tableau. St000177The number of free tiles in the pattern. St000178Number of free entries. St000307The number of rowmotion orbits of a poset. St001095The number of non-isomorphic posets with precisely one further covering relation. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001811The Castelnuovo-Mumford regularity of a permutation. St000717The number of ordinal summands of a poset. St000718The largest Laplacian eigenvalue of a graph if it is integral.