searching the database
Your data matches 5 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: St001808
Mp00202: Integer partitions —first row removal⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00028: Dyck paths —reverse⟶ Dyck paths
St001808: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00028: Dyck paths —reverse⟶ Dyck paths
St001808: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1]
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 2
[2,1]
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 2
[1,1,1]
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 3
[3,1]
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 2
[2,2]
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 4
[2,1,1]
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 3
[1,1,1,1]
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 4
[4,1]
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 2
[3,2]
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 4
[3,1,1]
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 3
[2,2,1]
=> [2,1]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 6
[2,1,1,1]
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 4
[1,1,1,1,1]
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 5
[5,1]
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 2
[4,2]
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 4
[4,1,1]
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 3
[3,3]
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 8
[3,2,1]
=> [2,1]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 6
[3,1,1,1]
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 4
[2,2,2]
=> [2,2]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 9
[2,2,1,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 8
[2,1,1,1,1]
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 5
[1,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 6
[6,1]
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 2
[5,2]
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 4
[5,1,1]
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 3
[4,3]
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 8
[4,2,1]
=> [2,1]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 6
[4,1,1,1]
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 4
[3,3,1]
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 12
[3,2,2]
=> [2,2]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 9
[3,2,1,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 8
[3,1,1,1,1]
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 5
[2,2,2,1]
=> [2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 12
[2,2,1,1,1]
=> [2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 10
[2,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 6
[1,1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> 7
[7,1]
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 2
[6,2]
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 4
[6,1,1]
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 3
[5,3]
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 8
[5,2,1]
=> [2,1]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 6
[5,1,1,1]
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 4
[4,4]
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 16
[4,3,1]
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 12
[4,2,2]
=> [2,2]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 9
[4,2,1,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 8
[4,1,1,1,1]
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 5
[3,3,2]
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 18
[3,3,1,1]
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 16
Description
The box weight or horizontal decoration of a Dyck path.
Let a Dyck path $D = (d_1,d_2,\dots,d_n)$ with steps $d_i \in \{N=(0,1),E=(1,0)\}$ be given.
For the $i$th step $d_i \in D$ we define the weight
$$
\beta(d_i) = 1, \quad \text{ if } d_i=N,
$$
and
$$
\beta(d_i) = \sum_{k = 1}^{i} [\![ d_k = N]\!], \quad \text{ if } d_i=E,
$$
where we use the Iverson bracket $[\![ A ]\!]$ that is equal to $1$ if $A$ is true, and $0$ otherwise.
The '''box weight''' or '''horizontal deocration''' of $D$ is defined as
$$
\prod_{i=1}^{n} \beta(d_i).
$$
The name describes the fact that between each $E$ step and the line $y=-1$ exactly one unit box is marked.
Matching statistic: St000708
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St000708: Integer partitions ⟶ ℤResult quality: 20% ●values known / values provided: 20%●distinct values known / distinct values provided: 20%
St000708: Integer partitions ⟶ ℤResult quality: 20% ●values known / values provided: 20%●distinct values known / distinct values provided: 20%
Values
[1,1]
=> [2]
=> 2
[2,1]
=> [2,1]
=> 2
[1,1,1]
=> [3]
=> 3
[3,1]
=> [2,1,1]
=> 2
[2,2]
=> [2,2]
=> 4
[2,1,1]
=> [3,1]
=> 3
[1,1,1,1]
=> [4]
=> 4
[4,1]
=> [2,1,1,1]
=> 2
[3,2]
=> [2,2,1]
=> 4
[3,1,1]
=> [3,1,1]
=> 3
[2,2,1]
=> [3,2]
=> 6
[2,1,1,1]
=> [4,1]
=> 4
[1,1,1,1,1]
=> [5]
=> 5
[5,1]
=> [2,1,1,1,1]
=> 2
[4,2]
=> [2,2,1,1]
=> 4
[4,1,1]
=> [3,1,1,1]
=> 3
[3,3]
=> [2,2,2]
=> 8
[3,2,1]
=> [3,2,1]
=> 6
[3,1,1,1]
=> [4,1,1]
=> 4
[2,2,2]
=> [3,3]
=> 9
[2,2,1,1]
=> [4,2]
=> 8
[2,1,1,1,1]
=> [5,1]
=> 5
[1,1,1,1,1,1]
=> [6]
=> 6
[6,1]
=> [2,1,1,1,1,1]
=> 2
[5,2]
=> [2,2,1,1,1]
=> 4
[5,1,1]
=> [3,1,1,1,1]
=> 3
[4,3]
=> [2,2,2,1]
=> 8
[4,2,1]
=> [3,2,1,1]
=> 6
[4,1,1,1]
=> [4,1,1,1]
=> 4
[3,3,1]
=> [3,2,2]
=> 12
[3,2,2]
=> [3,3,1]
=> 9
[3,2,1,1]
=> [4,2,1]
=> 8
[3,1,1,1,1]
=> [5,1,1]
=> 5
[2,2,2,1]
=> [4,3]
=> 12
[2,2,1,1,1]
=> [5,2]
=> 10
[2,1,1,1,1,1]
=> [6,1]
=> 6
[1,1,1,1,1,1,1]
=> [7]
=> 7
[7,1]
=> [2,1,1,1,1,1,1]
=> 2
[6,2]
=> [2,2,1,1,1,1]
=> 4
[6,1,1]
=> [3,1,1,1,1,1]
=> 3
[5,3]
=> [2,2,2,1,1]
=> 8
[5,2,1]
=> [3,2,1,1,1]
=> 6
[5,1,1,1]
=> [4,1,1,1,1]
=> 4
[4,4]
=> [2,2,2,2]
=> 16
[4,3,1]
=> [3,2,2,1]
=> 12
[4,2,2]
=> [3,3,1,1]
=> 9
[4,2,1,1]
=> [4,2,1,1]
=> 8
[4,1,1,1,1]
=> [5,1,1,1]
=> 5
[3,3,2]
=> [3,3,2]
=> 18
[3,3,1,1]
=> [4,2,2]
=> 16
[12,1]
=> [2,1,1,1,1,1,1,1,1,1,1,1]
=> ? = 2
[11,2]
=> [2,2,1,1,1,1,1,1,1,1,1]
=> ? = 4
[11,1,1]
=> [3,1,1,1,1,1,1,1,1,1,1]
=> ? = 3
[10,3]
=> [2,2,2,1,1,1,1,1,1,1]
=> ? = 8
[10,2,1]
=> [3,2,1,1,1,1,1,1,1,1]
=> ? = 6
[10,1,1,1]
=> [4,1,1,1,1,1,1,1,1,1]
=> ? = 4
[9,4]
=> [2,2,2,2,1,1,1,1,1]
=> ? = 16
[9,3,1]
=> [3,2,2,1,1,1,1,1,1]
=> ? = 12
[9,2,2]
=> [3,3,1,1,1,1,1,1,1]
=> ? = 9
[9,2,1,1]
=> [4,2,1,1,1,1,1,1,1]
=> ? = 8
[9,1,1,1,1]
=> [5,1,1,1,1,1,1,1,1]
=> ? = 5
[8,5]
=> [2,2,2,2,2,1,1,1]
=> ? = 32
[8,4,1]
=> [3,2,2,2,1,1,1,1]
=> ? = 24
[8,3,2]
=> [3,3,2,1,1,1,1,1]
=> ? = 18
[8,3,1,1]
=> [4,2,2,1,1,1,1,1]
=> ? = 16
[8,2,2,1]
=> [4,3,1,1,1,1,1,1]
=> ? = 12
[8,2,1,1,1]
=> [5,2,1,1,1,1,1,1]
=> ? = 10
[8,1,1,1,1,1]
=> [6,1,1,1,1,1,1,1]
=> ? = 6
[7,6]
=> [2,2,2,2,2,2,1]
=> ? = 64
[7,5,1]
=> [3,2,2,2,2,1,1]
=> ? = 48
[7,4,2]
=> [3,3,2,2,1,1,1]
=> ? = 36
[7,4,1,1]
=> [4,2,2,2,1,1,1]
=> ? = 32
[7,3,3]
=> [3,3,3,1,1,1,1]
=> ? = 27
[7,3,2,1]
=> [4,3,2,1,1,1,1]
=> ? = 24
[7,3,1,1,1]
=> [5,2,2,1,1,1,1]
=> ? = 20
[7,2,2,2]
=> [4,4,1,1,1,1,1]
=> ? = 16
[7,2,2,1,1]
=> [5,3,1,1,1,1,1]
=> ? = 15
[7,2,1,1,1,1]
=> [6,2,1,1,1,1,1]
=> ? = 12
[7,1,1,1,1,1,1]
=> [7,1,1,1,1,1,1]
=> ? = 7
[6,6,1]
=> [3,2,2,2,2,2]
=> ? = 96
[6,5,2]
=> [3,3,2,2,2,1]
=> ? = 72
[6,5,1,1]
=> [4,2,2,2,2,1]
=> ? = 64
[6,4,3]
=> [3,3,3,2,1,1]
=> ? = 54
[6,4,2,1]
=> [4,3,2,2,1,1]
=> ? = 48
[6,4,1,1,1]
=> [5,2,2,2,1,1]
=> ? = 40
[6,3,3,1]
=> [4,3,3,1,1,1]
=> ? = 36
[6,3,2,2]
=> [4,4,2,1,1,1]
=> ? = 32
[6,3,2,1,1]
=> [5,3,2,1,1,1]
=> ? = 30
[6,3,1,1,1,1]
=> [6,2,2,1,1,1]
=> ? = 24
[6,2,2,2,1]
=> [5,4,1,1,1,1]
=> ? = 20
[6,2,2,1,1,1]
=> [6,3,1,1,1,1]
=> ? = 18
[6,2,1,1,1,1,1]
=> [7,2,1,1,1,1]
=> ? = 14
[5,5,3]
=> [3,3,3,2,2]
=> ? = 108
[5,5,2,1]
=> [4,3,2,2,2]
=> ? = 96
[5,5,1,1,1]
=> [5,2,2,2,2]
=> ? = 80
[5,4,4]
=> [3,3,3,3,1]
=> ? = 81
[5,4,3,1]
=> [4,3,3,2,1]
=> ? = 72
[5,4,2,2]
=> [4,4,2,2,1]
=> ? = 64
[5,4,2,1,1]
=> [5,3,2,2,1]
=> ? = 60
[5,4,1,1,1,1]
=> [6,2,2,2,1]
=> ? = 48
Description
The product of the parts of an integer partition.
Matching statistic: St001959
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00044: Integer partitions —conjugate⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001959: Dyck paths ⟶ ℤResult quality: 5% ●values known / values provided: 5%●distinct values known / distinct values provided: 13%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001959: Dyck paths ⟶ ℤResult quality: 5% ●values known / values provided: 5%●distinct values known / distinct values provided: 13%
Values
[1,1]
=> [2]
=> [1,0,1,0]
=> [1,1,0,0]
=> 2
[2,1]
=> [2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
[1,1,1]
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 3
[3,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2
[2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 4
[2,1,1]
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 3
[1,1,1,1]
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4
[4,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 2
[3,2]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 4
[3,1,1]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3
[2,2,1]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 6
[2,1,1,1]
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 4
[1,1,1,1,1]
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[5,1]
=> [2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> 2
[4,2]
=> [2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 4
[4,1,1]
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 3
[3,3]
=> [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 8
[3,2,1]
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 6
[3,1,1,1]
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 4
[2,2,2]
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 9
[2,2,1,1]
=> [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 8
[2,1,1,1,1]
=> [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 5
[1,1,1,1,1,1]
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[6,1]
=> [2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 2
[5,2]
=> [2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> 4
[5,1,1]
=> [3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> ? = 3
[4,3]
=> [2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 8
[4,2,1]
=> [3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> 6
[4,1,1,1]
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 4
[3,3,1]
=> [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 12
[3,2,2]
=> [3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 9
[3,2,1,1]
=> [4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> 8
[3,1,1,1,1]
=> [5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 5
[2,2,2,1]
=> [4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 12
[2,2,1,1,1]
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 10
[2,1,1,1,1,1]
=> [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? = 6
[1,1,1,1,1,1,1]
=> [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? = 7
[7,1]
=> [2,1,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 2
[6,2]
=> [2,2,1,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 4
[6,1,1]
=> [3,1,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 3
[5,3]
=> [2,2,2,1,1]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> 8
[5,2,1]
=> [3,2,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0,1,0]
=> ? = 6
[5,1,1,1]
=> [4,1,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0]
=> ? = 4
[4,4]
=> [2,2,2,2]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 16
[4,3,1]
=> [3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> 12
[4,2,2]
=> [3,3,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> 9
[4,2,1,1]
=> [4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0,1,0]
=> ? = 8
[4,1,1,1,1]
=> [5,1,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
=> ? = 5
[3,3,2]
=> [3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 18
[3,3,1,1]
=> [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> 16
[3,2,2,1]
=> [4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> 12
[3,2,1,1,1]
=> [5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0,1,0]
=> ? = 10
[3,1,1,1,1,1]
=> [6,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0]
=> ? = 6
[2,2,2,2]
=> [4,4]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 16
[2,2,2,1,1]
=> [5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 15
[2,2,1,1,1,1]
=> [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> ? = 12
[2,1,1,1,1,1,1]
=> [7,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 7
[8,1]
=> [2,1,1,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 2
[7,2]
=> [2,2,1,1,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 4
[7,1,1]
=> [3,1,1,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 3
[6,3]
=> [2,2,2,1,1,1]
=> [1,1,1,1,0,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0,1,0]
=> ? = 8
[6,2,1]
=> [3,2,1,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 6
[6,1,1,1]
=> [4,1,1,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 4
[5,4]
=> [2,2,2,2,1]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 16
[5,3,1]
=> [3,2,2,1,1]
=> [1,0,1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0,1,0]
=> ? = 12
[5,2,2]
=> [3,3,1,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0,1,0]
=> ? = 9
[5,2,1,1]
=> [4,2,1,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0,1,0,1,0]
=> ? = 8
[5,1,1,1,1]
=> [5,1,1,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0,1,0]
=> ? = 5
[4,4,1]
=> [3,2,2,2]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> 24
[4,3,2]
=> [3,3,2,1]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> 18
[4,3,1,1]
=> [4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0,1,0]
=> ? = 16
[4,2,2,1]
=> [4,3,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0,1,0]
=> ? = 12
[4,2,1,1,1]
=> [5,2,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0,1,0,1,0]
=> ? = 10
[4,1,1,1,1,1]
=> [6,1,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0,1,0]
=> ? = 6
[3,3,3]
=> [3,3,3]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 27
[3,3,2,1]
=> [4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> 24
[3,3,1,1,1]
=> [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,1,0,0]
=> ? = 20
[3,2,2,2]
=> [4,4,1]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> 16
[3,2,2,1,1]
=> [5,3,1]
=> [1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0,1,0]
=> ? = 15
[3,2,1,1,1,1]
=> [6,2,1]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0,1,0]
=> ? = 12
[3,1,1,1,1,1,1]
=> [7,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0,1,0]
=> ? = 7
[2,2,2,2,1]
=> [5,4]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 20
[2,2,2,1,1,1]
=> [6,3]
=> [1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,0]
=> ? = 18
[2,2,1,1,1,1,1]
=> [7,2]
=> [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,1,0,0]
=> ? = 14
[9,1]
=> [2,1,1,1,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 2
[8,2]
=> [2,2,1,1,1,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 4
[8,1,1]
=> [3,1,1,1,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 3
[7,3]
=> [2,2,2,1,1,1,1]
=> [1,1,1,1,0,0,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 8
[7,2,1]
=> [3,2,1,1,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 6
[7,1,1,1]
=> [4,1,1,1,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 4
[6,4]
=> [2,2,2,2,1,1]
=> [1,1,1,1,0,1,0,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0,1,0]
=> ? = 16
[6,3,1]
=> [3,2,2,1,1,1]
=> [1,0,1,1,1,1,0,0,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0,1,0,1,0]
=> ? = 12
[6,2,2]
=> [3,3,1,1,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0,1,0,1,0]
=> ? = 9
[6,2,1,1]
=> [4,2,1,1,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 8
[6,1,1,1,1]
=> [5,1,1,1,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 5
[5,5]
=> [2,2,2,2,2]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 32
[5,4,1]
=> [3,2,2,2,1]
=> [1,0,1,1,1,1,0,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0,1,0]
=> ? = 24
[5,3,2]
=> [3,3,2,1,1]
=> [1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0,1,0]
=> ? = 18
[4,4,2]
=> [3,3,2,2]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 36
[4,3,3]
=> [3,3,3,1]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> 27
Description
The product of the heights of the peaks of a Dyck path.
Matching statistic: St001232
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001232: Dyck paths ⟶ ℤResult quality: 2% ●values known / values provided: 2%●distinct values known / distinct values provided: 4%
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001232: Dyck paths ⟶ ℤResult quality: 2% ●values known / values provided: 2%●distinct values known / distinct values provided: 4%
Values
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1 = 2 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> 2 = 3 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[2,2]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> ? = 4 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2 = 3 - 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3 = 4 - 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1 = 2 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> ? = 4 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2 = 3 - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> ? = 6 - 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3 = 4 - 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4 = 5 - 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1 = 2 - 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ? = 4 - 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 3 - 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> ? = 8 - 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> ? = 6 - 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 3 = 4 - 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> ? = 9 - 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> ? = 8 - 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 4 = 5 - 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> 5 = 6 - 1
[6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> 1 = 2 - 1
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 4 - 1
[5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> 2 = 3 - 1
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> ? = 8 - 1
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,1,0,0]
=> ? = 6 - 1
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,0]
=> 3 = 4 - 1
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> ? = 12 - 1
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> ? = 9 - 1
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,1,0,0,0]
=> ? = 8 - 1
[3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,1,0,0,0,0]
=> 4 = 5 - 1
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> ? = 12 - 1
[2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> ? = 10 - 1
[2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,1,0,0,0,0,0]
=> 5 = 6 - 1
[1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> 6 = 7 - 1
[7,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 2 - 1
[6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 4 - 1
[6,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,1,0,0]
=> ? = 3 - 1
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> ? = 8 - 1
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,1,0,1,0,0]
=> ? = 6 - 1
[5,1,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,1,0,0,0]
=> ? = 4 - 1
[4,4]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> ? = 16 - 1
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> ? = 12 - 1
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> ? = 9 - 1
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,1,0,1,0,0,0]
=> ? = 8 - 1
[4,1,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,1,0,0,0,0]
=> ? = 5 - 1
[3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> ? = 18 - 1
[3,3,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> ? = 16 - 1
[3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,1,0,0]
=> ? = 12 - 1
[3,2,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,1,0,1,0,0,0,0]
=> ? = 10 - 1
[3,1,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,1,0,0,0,1,0,0,0,0,0]
=> ? = 6 - 1
[2,2,2,2]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> ? = 16 - 1
[2,2,2,1,1]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> ? = 15 - 1
[2,2,1,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> ? = 12 - 1
[2,1,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0]
=> ? = 7 - 1
[8,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> ? = 2 - 1
[7,2]
=> [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0]
=> ? = 4 - 1
[7,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0,0]
=> ? = 3 - 1
[6,3]
=> [1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,1,0,0]
=> ? = 8 - 1
[6,2,1]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,1,0,1,0,0]
=> ? = 6 - 1
[6,1,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,1,0,0,0]
=> ? = 4 - 1
[5,4]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> ? = 16 - 1
[5,3,1]
=> [1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,1,0,0,0]
=> ? = 12 - 1
[5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 9 - 1
[5,2,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,1,1,0,1,0,0,0]
=> ? = 8 - 1
[5,1,1,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,1,0,0,0,0]
=> ? = 5 - 1
[4,4,1]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> ? = 24 - 1
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> ? = 18 - 1
[4,3,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,1,1,0,1,0,0,0,0]
=> ? = 16 - 1
Description
The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.
Matching statistic: St000454
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
Mp00207: Standard tableaux —horizontal strip sizes⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000454: Graphs ⟶ ℤResult quality: 2% ●values known / values provided: 2%●distinct values known / distinct values provided: 4%
Mp00207: Standard tableaux —horizontal strip sizes⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000454: Graphs ⟶ ℤResult quality: 2% ●values known / values provided: 2%●distinct values known / distinct values provided: 4%
Values
[1,1]
=> [[1],[2]]
=> [1,1] => ([(0,1)],2)
=> 1 = 2 - 1
[2,1]
=> [[1,3],[2]]
=> [1,2] => ([(1,2)],3)
=> 1 = 2 - 1
[1,1,1]
=> [[1],[2],[3]]
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[3,1]
=> [[1,3,4],[2]]
=> [1,3] => ([(2,3)],4)
=> 1 = 2 - 1
[2,2]
=> [[1,2],[3,4]]
=> [2,2] => ([(1,3),(2,3)],4)
=> ? = 4 - 1
[2,1,1]
=> [[1,4],[2],[3]]
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[4,1]
=> [[1,3,4,5],[2]]
=> [1,4] => ([(3,4)],5)
=> 1 = 2 - 1
[3,2]
=> [[1,2,5],[3,4]]
=> [2,3] => ([(2,4),(3,4)],5)
=> ? = 4 - 1
[3,1,1]
=> [[1,4,5],[2],[3]]
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
[2,2,1]
=> [[1,3],[2,5],[4]]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 6 - 1
[2,1,1,1]
=> [[1,5],[2],[3],[4]]
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 4 - 1
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
[5,1]
=> [[1,3,4,5,6],[2]]
=> [1,5] => ([(4,5)],6)
=> 1 = 2 - 1
[4,2]
=> [[1,2,5,6],[3,4]]
=> [2,4] => ([(3,5),(4,5)],6)
=> ? = 4 - 1
[4,1,1]
=> [[1,4,5,6],[2],[3]]
=> [1,1,4] => ([(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
[3,3]
=> [[1,2,3],[4,5,6]]
=> [3,3] => ([(2,5),(3,5),(4,5)],6)
=> ? = 8 - 1
[3,2,1]
=> [[1,3,6],[2,5],[4]]
=> [1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 6 - 1
[3,1,1,1]
=> [[1,5,6],[2],[3],[4]]
=> [1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 4 - 1
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 9 - 1
[2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> [1,1,2,2] => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 8 - 1
[2,1,1,1,1]
=> [[1,6],[2],[3],[4],[5]]
=> [1,1,1,1,2] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 5 - 1
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [1,1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5 = 6 - 1
[6,1]
=> [[1,3,4,5,6,7],[2]]
=> [1,6] => ([(5,6)],7)
=> 1 = 2 - 1
[5,2]
=> [[1,2,5,6,7],[3,4]]
=> [2,5] => ([(4,6),(5,6)],7)
=> ? = 4 - 1
[5,1,1]
=> [[1,4,5,6,7],[2],[3]]
=> [1,1,5] => ([(4,5),(4,6),(5,6)],7)
=> 2 = 3 - 1
[4,3]
=> [[1,2,3,7],[4,5,6]]
=> [3,4] => ([(3,6),(4,6),(5,6)],7)
=> ? = 8 - 1
[4,2,1]
=> [[1,3,6,7],[2,5],[4]]
=> [1,2,4] => ([(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 6 - 1
[4,1,1,1]
=> [[1,5,6,7],[2],[3],[4]]
=> [1,1,1,4] => ([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 3 = 4 - 1
[3,3,1]
=> [[1,3,4],[2,6,7],[5]]
=> [1,3,3] => ([(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 12 - 1
[3,2,2]
=> [[1,2,7],[3,4],[5,6]]
=> [2,2,3] => ([(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 9 - 1
[3,2,1,1]
=> [[1,4,7],[2,6],[3],[5]]
=> [1,1,2,3] => ([(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 8 - 1
[3,1,1,1,1]
=> [[1,6,7],[2],[3],[4],[5]]
=> [1,1,1,1,3] => ([(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 4 = 5 - 1
[2,2,2,1]
=> [[1,3],[2,5],[4,7],[6]]
=> [1,2,2,2] => ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 12 - 1
[2,2,1,1,1]
=> [[1,5],[2,7],[3],[4],[6]]
=> [1,1,1,2,2] => ([(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 10 - 1
[2,1,1,1,1,1]
=> [[1,7],[2],[3],[4],[5],[6]]
=> [1,1,1,1,1,2] => ([(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 5 = 6 - 1
[1,1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6],[7]]
=> [1,1,1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 6 = 7 - 1
[7,1]
=> [[1,3,4,5,6,7,8],[2]]
=> [1,7] => ([(6,7)],8)
=> ? = 2 - 1
[6,2]
=> [[1,2,5,6,7,8],[3,4]]
=> [2,6] => ([(5,7),(6,7)],8)
=> ? = 4 - 1
[6,1,1]
=> [[1,4,5,6,7,8],[2],[3]]
=> [1,1,6] => ([(5,6),(5,7),(6,7)],8)
=> ? = 3 - 1
[5,3]
=> [[1,2,3,7,8],[4,5,6]]
=> [3,5] => ([(4,7),(5,7),(6,7)],8)
=> ? = 8 - 1
[5,2,1]
=> [[1,3,6,7,8],[2,5],[4]]
=> [1,2,5] => ([(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 6 - 1
[5,1,1,1]
=> [[1,5,6,7,8],[2],[3],[4]]
=> [1,1,1,5] => ([(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 4 - 1
[4,4]
=> [[1,2,3,4],[5,6,7,8]]
=> [4,4] => ([(3,7),(4,7),(5,7),(6,7)],8)
=> ? = 16 - 1
[4,3,1]
=> [[1,3,4,8],[2,6,7],[5]]
=> [1,3,4] => ([(3,7),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 12 - 1
[4,2,2]
=> [[1,2,7,8],[3,4],[5,6]]
=> [2,2,4] => ([(3,7),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 9 - 1
[4,2,1,1]
=> [[1,4,7,8],[2,6],[3],[5]]
=> [1,1,2,4] => ([(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 8 - 1
[4,1,1,1,1]
=> [[1,6,7,8],[2],[3],[4],[5]]
=> [1,1,1,1,4] => ([(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5 - 1
[3,3,2]
=> [[1,2,5],[3,4,8],[6,7]]
=> [2,3,3] => ([(2,7),(3,7),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 18 - 1
[3,3,1,1]
=> [[1,4,5],[2,7,8],[3],[6]]
=> [1,1,3,3] => ([(2,7),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 16 - 1
[3,2,2,1]
=> [[1,3,8],[2,5],[4,7],[6]]
=> [1,2,2,3] => ([(2,7),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 12 - 1
[3,2,1,1,1]
=> [[1,5,8],[2,7],[3],[4],[6]]
=> [1,1,1,2,3] => ([(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 10 - 1
[3,1,1,1,1,1]
=> [[1,7,8],[2],[3],[4],[5],[6]]
=> [1,1,1,1,1,3] => ([(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 6 - 1
[2,2,2,2]
=> [[1,2],[3,4],[5,6],[7,8]]
=> [2,2,2,2] => ([(1,7),(2,6),(2,7),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 16 - 1
[2,2,2,1,1]
=> [[1,4],[2,6],[3,8],[5],[7]]
=> [1,1,2,2,2] => ([(1,7),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 15 - 1
[2,2,1,1,1,1]
=> [[1,6],[2,8],[3],[4],[5],[7]]
=> [1,1,1,1,2,2] => ([(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 12 - 1
[2,1,1,1,1,1,1]
=> [[1,8],[2],[3],[4],[5],[6],[7]]
=> [1,1,1,1,1,1,2] => ([(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 7 - 1
[8,1]
=> [[1,3,4,5,6,7,8,9],[2]]
=> [1,8] => ([(7,8)],9)
=> ? = 2 - 1
[7,2]
=> [[1,2,5,6,7,8,9],[3,4]]
=> [2,7] => ([(6,8),(7,8)],9)
=> ? = 4 - 1
[7,1,1]
=> [[1,4,5,6,7,8,9],[2],[3]]
=> [1,1,7] => ([(6,7),(6,8),(7,8)],9)
=> ? = 3 - 1
[6,3]
=> [[1,2,3,7,8,9],[4,5,6]]
=> [3,6] => ([(5,8),(6,8),(7,8)],9)
=> ? = 8 - 1
[6,2,1]
=> [[1,3,6,7,8,9],[2,5],[4]]
=> [1,2,6] => ([(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 6 - 1
[6,1,1,1]
=> [[1,5,6,7,8,9],[2],[3],[4]]
=> [1,1,1,6] => ([(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 4 - 1
[5,4]
=> [[1,2,3,4,9],[5,6,7,8]]
=> [4,5] => ([(4,8),(5,8),(6,8),(7,8)],9)
=> ? = 16 - 1
[5,3,1]
=> [[1,3,4,8,9],[2,6,7],[5]]
=> [1,3,5] => ([(4,8),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 12 - 1
[5,2,2]
=> [[1,2,7,8,9],[3,4],[5,6]]
=> [2,2,5] => ([(4,8),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 9 - 1
[5,2,1,1]
=> [[1,4,7,8,9],[2,6],[3],[5]]
=> [1,1,2,5] => ([(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 8 - 1
[5,1,1,1,1]
=> [[1,6,7,8,9],[2],[3],[4],[5]]
=> [1,1,1,1,5] => ([(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 5 - 1
[4,4,1]
=> [[1,3,4,5],[2,7,8,9],[6]]
=> [1,4,4] => ([(3,8),(4,8),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 24 - 1
[4,3,2]
=> [[1,2,5,9],[3,4,8],[6,7]]
=> [2,3,4] => ([(3,8),(4,8),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 18 - 1
[4,3,1,1]
=> [[1,4,5,9],[2,7,8],[3],[6]]
=> [1,1,3,4] => ([(3,8),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 16 - 1
Description
The largest eigenvalue of a graph if it is integral.
If a graph is $d$-regular, then its largest eigenvalue equals $d$. One can show that the largest eigenvalue always lies between the average degree and the maximal degree.
This statistic is undefined if the largest eigenvalue of the graph is not integral.
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!