searching the database
Your data matches 216 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: St001107
(load all 28 compositions to match this statistic)
(load all 28 compositions to match this statistic)
St001107: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> 0
[1,1,0,0]
=> 2
[1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> 0
[1,1,0,0,1,0]
=> 0
[1,1,0,1,0,0]
=> 1
[1,1,1,0,0,0]
=> 3
[1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,0]
=> 0
[1,0,1,1,1,0,0,0]
=> 0
[1,1,0,0,1,0,1,0]
=> 0
[1,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> 0
[1,1,0,1,0,1,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> 0
[1,1,1,0,0,1,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> 2
[1,1,1,1,0,0,0,0]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> 0
Description
The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path.
In other words, this is the lowest height of a valley of a Dyck path, or its semilength in case of the unique path without valleys.
Matching statistic: St000974
(load all 10 compositions to match this statistic)
(load all 10 compositions to match this statistic)
Mp00026: Dyck paths —to ordered tree⟶ Ordered trees
St000974: Ordered trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000974: Ordered trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [[],[]]
=> 0
[1,1,0,0]
=> [[[]]]
=> 2
[1,0,1,0,1,0]
=> [[],[],[]]
=> 0
[1,0,1,1,0,0]
=> [[],[[]]]
=> 0
[1,1,0,0,1,0]
=> [[[]],[]]
=> 0
[1,1,0,1,0,0]
=> [[[],[]]]
=> 1
[1,1,1,0,0,0]
=> [[[[]]]]
=> 3
[1,0,1,0,1,0,1,0]
=> [[],[],[],[]]
=> 0
[1,0,1,0,1,1,0,0]
=> [[],[],[[]]]
=> 0
[1,0,1,1,0,0,1,0]
=> [[],[[]],[]]
=> 0
[1,0,1,1,0,1,0,0]
=> [[],[[],[]]]
=> 0
[1,0,1,1,1,0,0,0]
=> [[],[[[]]]]
=> 0
[1,1,0,0,1,0,1,0]
=> [[[]],[],[]]
=> 0
[1,1,0,0,1,1,0,0]
=> [[[]],[[]]]
=> 0
[1,1,0,1,0,0,1,0]
=> [[[],[]],[]]
=> 0
[1,1,0,1,0,1,0,0]
=> [[[],[],[]]]
=> 1
[1,1,0,1,1,0,0,0]
=> [[[],[[]]]]
=> 1
[1,1,1,0,0,0,1,0]
=> [[[[]]],[]]
=> 0
[1,1,1,0,0,1,0,0]
=> [[[[]],[]]]
=> 1
[1,1,1,0,1,0,0,0]
=> [[[[],[]]]]
=> 2
[1,1,1,1,0,0,0,0]
=> [[[[[]]]]]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [[],[],[],[],[]]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [[],[],[],[[]]]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [[],[],[[]],[]]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [[],[],[[],[]]]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [[],[],[[[]]]]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [[],[[]],[],[]]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [[],[[]],[[]]]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [[],[[],[]],[]]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [[],[[],[],[]]]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [[],[[],[[]]]]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [[],[[[]]],[]]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [[],[[[]],[]]]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [[],[[[],[]]]]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [[],[[[[]]]]]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [[[]],[],[],[]]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [[[]],[],[[]]]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [[[]],[[]],[]]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [[[]],[[],[]]]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [[[]],[[[]]]]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [[[],[]],[],[]]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [[[],[]],[[]]]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [[[],[],[]],[]]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [[[],[],[],[]]]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [[[],[],[[]]]]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [[[],[[]]],[]]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [[[],[[]],[]]]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [[[],[[],[]]]]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [[[],[[[]]]]]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [[[[]]],[],[]]
=> 0
Description
The length of the trunk of an ordered tree.
This is the length of the path from the root to the first vertex which has not exactly one child.
Matching statistic: St000674
(load all 28 compositions to match this statistic)
(load all 28 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
St000674: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
St000674: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,0,1,0]
=> [1,0,1,0]
=> 2
[1,1,0,0]
=> [1,1,0,0]
=> [1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 3
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 0
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 0
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 4
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> 0
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 0
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> 0
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 0
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> 0
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 0
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 3
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 0
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 0
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
Description
The number of hills of a Dyck path.
A hill is a peak with up step starting and down step ending at height zero.
Matching statistic: St000297
(load all 14 compositions to match this statistic)
(load all 14 compositions to match this statistic)
Mp00100: Dyck paths —touch composition⟶ Integer compositions
Mp00094: Integer compositions —to binary word⟶ Binary words
Mp00269: Binary words —flag zeros to zeros⟶ Binary words
St000297: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00094: Integer compositions —to binary word⟶ Binary words
Mp00269: Binary words —flag zeros to zeros⟶ Binary words
St000297: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1] => 11 => 11 => 2
[1,1,0,0]
=> [2] => 10 => 00 => 0
[1,0,1,0,1,0]
=> [1,1,1] => 111 => 111 => 3
[1,0,1,1,0,0]
=> [1,2] => 110 => 001 => 0
[1,1,0,0,1,0]
=> [2,1] => 101 => 100 => 1
[1,1,0,1,0,0]
=> [3] => 100 => 010 => 0
[1,1,1,0,0,0]
=> [3] => 100 => 010 => 0
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => 1111 => 1111 => 4
[1,0,1,0,1,1,0,0]
=> [1,1,2] => 1110 => 0011 => 0
[1,0,1,1,0,0,1,0]
=> [1,2,1] => 1101 => 1001 => 1
[1,0,1,1,0,1,0,0]
=> [1,3] => 1100 => 0101 => 0
[1,0,1,1,1,0,0,0]
=> [1,3] => 1100 => 0101 => 0
[1,1,0,0,1,0,1,0]
=> [2,1,1] => 1011 => 1100 => 2
[1,1,0,0,1,1,0,0]
=> [2,2] => 1010 => 0000 => 0
[1,1,0,1,0,0,1,0]
=> [3,1] => 1001 => 1010 => 1
[1,1,0,1,0,1,0,0]
=> [4] => 1000 => 0110 => 0
[1,1,0,1,1,0,0,0]
=> [4] => 1000 => 0110 => 0
[1,1,1,0,0,0,1,0]
=> [3,1] => 1001 => 1010 => 1
[1,1,1,0,0,1,0,0]
=> [4] => 1000 => 0110 => 0
[1,1,1,0,1,0,0,0]
=> [4] => 1000 => 0110 => 0
[1,1,1,1,0,0,0,0]
=> [4] => 1000 => 0110 => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => 11111 => 11111 => 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => 11110 => 00111 => 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => 11101 => 10011 => 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,3] => 11100 => 01011 => 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => 11100 => 01011 => 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => 11011 => 11001 => 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => 11010 => 00001 => 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,1] => 11001 => 10101 => 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,4] => 11000 => 01101 => 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,4] => 11000 => 01101 => 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => 11001 => 10101 => 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4] => 11000 => 01101 => 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,4] => 11000 => 01101 => 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => 11000 => 01101 => 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => 10111 => 11100 => 3
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => 10110 => 00100 => 0
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => 10101 => 10000 => 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,3] => 10100 => 01000 => 0
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => 10100 => 01000 => 0
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,1] => 10011 => 11010 => 2
[1,1,0,1,0,0,1,1,0,0]
=> [3,2] => 10010 => 00010 => 0
[1,1,0,1,0,1,0,0,1,0]
=> [4,1] => 10001 => 10110 => 1
[1,1,0,1,0,1,0,1,0,0]
=> [5] => 10000 => 01110 => 0
[1,1,0,1,0,1,1,0,0,0]
=> [5] => 10000 => 01110 => 0
[1,1,0,1,1,0,0,0,1,0]
=> [4,1] => 10001 => 10110 => 1
[1,1,0,1,1,0,0,1,0,0]
=> [5] => 10000 => 01110 => 0
[1,1,0,1,1,0,1,0,0,0]
=> [5] => 10000 => 01110 => 0
[1,1,0,1,1,1,0,0,0,0]
=> [5] => 10000 => 01110 => 0
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => 10011 => 11010 => 2
Description
The number of leading ones in a binary word.
Matching statistic: St000312
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00203: Graphs —cone⟶ Graphs
St000312: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00203: Graphs —cone⟶ Graphs
St000312: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1] => ([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 0
[1,1,0,0]
=> [2] => ([],2)
=> ([(0,2),(1,2)],3)
=> 2
[1,0,1,0,1,0]
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
[1,0,1,1,0,0]
=> [1,2] => ([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,0]
=> [2,1] => ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
[1,1,0,1,0,0]
=> [2,1] => ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
[1,1,1,0,0,0]
=> [3] => ([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> 3
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,0,1,0,0]
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,1,0,0,0]
=> [1,3] => ([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,0,1,0,1,0]
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,0,1,1,0,0]
=> [2,2] => ([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,0,1,0]
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,1,0,1,0,0]
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,1,1,0,0,0]
=> [2,2] => ([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,1,0,0,0,1,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,1,0,0,1,0,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,1,0,1,0,0,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,1,1,0,0,0,0]
=> [4] => ([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [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)
=> ([(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)
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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)
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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)
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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)
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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)
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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)
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => ([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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)
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => ([(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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)
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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)
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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)
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => ([(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
Description
The number of leaves in a graph.
That is, the number of vertices of a graph that have degree 1.
Matching statistic: St000445
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00159: Permutations —Demazure product with inverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St000445: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00159: Permutations —Demazure product with inverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St000445: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [2,1] => [2,1] => [1,1,0,0]
=> 0
[1,1,0,0]
=> [1,2] => [1,2] => [1,0,1,0]
=> 2
[1,0,1,0,1,0]
=> [3,2,1] => [3,2,1] => [1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0]
=> [2,3,1] => [3,2,1] => [1,1,1,0,0,0]
=> 0
[1,1,0,0,1,0]
=> [3,1,2] => [3,2,1] => [1,1,1,0,0,0]
=> 0
[1,1,0,1,0,0]
=> [2,1,3] => [2,1,3] => [1,1,0,0,1,0]
=> 1
[1,1,1,0,0,0]
=> [1,2,3] => [1,2,3] => [1,0,1,0,1,0]
=> 3
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 0
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => [5,3,2,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => [5,3,2,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => [5,3,2,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => [4,3,2,1,5] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => [4,3,2,1,5] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => [4,3,2,1,5] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => [4,2,3,1,5] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => [4,2,3,1,5] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0
Description
The number of rises of length 1 of a Dyck path.
Matching statistic: St000475
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St000475: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St000475: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> [2]
=> 0
[1,1,0,0]
=> [1,2] => ([],2)
=> [1,1]
=> 2
[1,0,1,0,1,0]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 0
[1,0,1,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> [3]
=> 0
[1,1,0,0,1,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> [3]
=> 0
[1,1,0,1,0,0]
=> [2,1,3] => ([(1,2)],3)
=> [2,1]
=> 1
[1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> [1,1,1]
=> 3
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 0
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 0
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 0
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 0
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> [4]
=> 0
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 0
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> 0
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 0
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> 1
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => ([(1,3),(2,3)],4)
=> [3,1]
=> 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> [4]
=> 0
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => ([(1,3),(2,3)],4)
=> [3,1]
=> 1
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => ([(2,3)],4)
=> [2,1,1]
=> 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([],4)
=> [1,1,1,1]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [5]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [5]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [5]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 0
Description
The number of parts equal to 1 in a partition.
Matching statistic: St000382
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00038: Integer compositions —reverse⟶ Integer compositions
St000382: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00038: Integer compositions —reverse⟶ Integer compositions
St000382: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [2,1] => [1,2] => 1 = 0 + 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [3] => [3] => 3 = 2 + 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,2] => 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [2,2] => [2,2] => 2 = 1 + 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1] => [1,3] => 1 = 0 + 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [3,1] => [1,3] => 1 = 0 + 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => [4] => 4 = 3 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,1,2] => 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [2,1,2] => 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,2,2] => 1 = 0 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,2,2] => 1 = 0 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [3,2] => 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,1,1] => [1,1,3] => 1 = 0 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,2] => [2,3] => 2 = 1 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [3,1,1] => [1,1,3] => 1 = 0 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [3,1,1] => [1,1,3] => 1 = 0 + 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [3,2] => [2,3] => 2 = 1 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,1] => [1,4] => 1 = 0 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [4,1] => [1,4] => 1 = 0 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [4,1] => [1,4] => 1 = 0 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5] => [5] => 5 = 4 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1,1] => [1,1,1,1,2] => 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [2,1,1,2] => [2,1,1,2] => 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [2,1,2,1] => [1,2,1,2] => 1 = 0 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [2,1,2,1] => [1,2,1,2] => 1 = 0 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [2,1,3] => [3,1,2] => 3 = 2 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [2,2,1,1] => [1,1,2,2] => 1 = 0 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [2,2,2] => [2,2,2] => 2 = 1 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [2,2,1,1] => [1,1,2,2] => 1 = 0 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [2,2,1,1] => [1,1,2,2] => 1 = 0 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [2,2,2] => [2,2,2] => 2 = 1 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [2,3,1] => [1,3,2] => 1 = 0 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [2,3,1] => [1,3,2] => 1 = 0 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [2,3,1] => [1,3,2] => 1 = 0 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [2,4] => [4,2] => 4 = 3 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [3,1,1,1] => [1,1,1,3] => 1 = 0 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [3,1,2] => [2,1,3] => 2 = 1 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [3,2,1] => [1,2,3] => 1 = 0 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [3,2,1] => [1,2,3] => 1 = 0 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [3,3] => [3,3] => 3 = 2 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [3,1,1,1] => [1,1,1,3] => 1 = 0 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [3,1,2] => [2,1,3] => 2 = 1 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [3,1,1,1] => [1,1,1,3] => 1 = 0 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [3,1,1,1] => [1,1,1,3] => 1 = 0 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [3,1,2] => [2,1,3] => 2 = 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,2,1] => [1,2,3] => 1 = 0 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [3,2,1] => [1,2,3] => 1 = 0 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [3,2,1] => [1,2,3] => 1 = 0 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [3,3] => [3,3] => 3 = 2 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [4,1,1] => [1,1,4] => 1 = 0 + 1
Description
The first part of an integer composition.
Matching statistic: St000678
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00142: Dyck paths —promotion⟶ Dyck paths
St000678: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00142: Dyck paths —promotion⟶ Dyck paths
St000678: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1 = 0 + 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
Description
The number of up steps after the last double rise of a Dyck path.
Matching statistic: St001691
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00159: Permutations —Demazure product with inverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001691: Graphs ⟶ ℤResult quality: 98% ●values known / values provided: 98%●distinct values known / distinct values provided: 100%
Mp00159: Permutations —Demazure product with inverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001691: Graphs ⟶ ℤResult quality: 98% ●values known / values provided: 98%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [2,1] => [2,1] => ([(0,1)],2)
=> 0
[1,1,0,0]
=> [1,2] => [1,2] => ([],2)
=> 2
[1,0,1,0,1,0]
=> [3,2,1] => [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 0
[1,0,1,1,0,0]
=> [2,3,1] => [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 0
[1,1,0,0,1,0]
=> [3,1,2] => [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 0
[1,1,0,1,0,0]
=> [2,1,3] => [2,1,3] => ([(1,2)],3)
=> 1
[1,1,1,0,0,0]
=> [1,2,3] => [1,2,3] => ([],3)
=> 3
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => [2,1,3,4] => ([(2,3)],4)
=> 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,2,3,4] => ([],4)
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => [5,3,2,4,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => [5,3,2,4,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => [5,3,2,4,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => [5,2,3,4,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [5,2,3,4,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => [4,3,2,1,5] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => [4,3,2,1,5] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => [4,3,2,1,5] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => [4,2,3,1,5] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => [4,2,3,1,5] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,1,0,1,0,1,0,1,0,0,0]
=> [5,4,3,2,6,7,1] => [7,4,3,2,5,6,1] => ([(0,5),(0,6),(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)
=> ? ∊ {0,0,0,0,0,0,0,0,0,0,0,0}
[1,0,1,1,1,0,1,0,1,1,0,0,0,0]
=> [4,5,3,2,6,7,1] => [7,4,3,2,5,6,1] => ([(0,5),(0,6),(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)
=> ? ∊ {0,0,0,0,0,0,0,0,0,0,0,0}
[1,0,1,1,1,0,1,1,0,0,1,0,0,0]
=> [5,3,4,2,6,7,1] => [7,4,3,2,5,6,1] => ([(0,5),(0,6),(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)
=> ? ∊ {0,0,0,0,0,0,0,0,0,0,0,0}
[1,0,1,1,1,0,1,1,0,1,0,0,0,0]
=> [4,3,5,2,6,7,1] => [7,4,3,2,5,6,1] => ([(0,5),(0,6),(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)
=> ? ∊ {0,0,0,0,0,0,0,0,0,0,0,0}
[1,0,1,1,1,0,1,1,1,0,0,0,0,0]
=> [3,4,5,2,6,7,1] => [7,4,3,2,5,6,1] => ([(0,5),(0,6),(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)
=> ? ∊ {0,0,0,0,0,0,0,0,0,0,0,0}
[1,0,1,1,1,1,0,0,1,0,1,0,0,0]
=> [5,4,2,3,6,7,1] => [7,4,3,2,5,6,1] => ([(0,5),(0,6),(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)
=> ? ∊ {0,0,0,0,0,0,0,0,0,0,0,0}
[1,0,1,1,1,1,0,0,1,1,0,0,0,0]
=> [4,5,2,3,6,7,1] => [7,4,3,2,5,6,1] => ([(0,5),(0,6),(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)
=> ? ∊ {0,0,0,0,0,0,0,0,0,0,0,0}
[1,0,1,1,1,1,0,1,0,0,1,0,0,0]
=> [5,3,2,4,6,7,1] => [7,4,3,2,5,6,1] => ([(0,5),(0,6),(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)
=> ? ∊ {0,0,0,0,0,0,0,0,0,0,0,0}
[1,0,1,1,1,1,1,0,0,0,1,0,0,0]
=> [5,2,3,4,6,7,1] => [7,4,3,2,5,6,1] => ([(0,5),(0,6),(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)
=> ? ∊ {0,0,0,0,0,0,0,0,0,0,0,0}
[1,1,1,1,0,1,0,1,0,0,0,0,1,0]
=> [7,3,2,1,4,5,6] => [7,4,3,2,5,6,1] => ([(0,5),(0,6),(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)
=> ? ∊ {0,0,0,0,0,0,0,0,0,0,0,0}
[1,1,1,1,0,1,1,0,0,0,0,0,1,0]
=> [7,2,3,1,4,5,6] => [7,4,3,2,5,6,1] => ([(0,5),(0,6),(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)
=> ? ∊ {0,0,0,0,0,0,0,0,0,0,0,0}
[1,1,1,1,1,0,0,1,0,0,0,0,1,0]
=> [7,3,1,2,4,5,6] => [7,4,3,2,5,6,1] => ([(0,5),(0,6),(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)
=> ? ∊ {0,0,0,0,0,0,0,0,0,0,0,0}
Description
The number of kings in a graph.
A vertex of a graph is a king, if all its neighbours have smaller degree. In particular, an isolated vertex is a king.
The following 206 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000326The position of the first one in a binary word after appending a 1 at the end. St000383The last part of an integer composition. St000022The number of fixed points of a permutation. St000288The number of ones in a binary word. St000392The length of the longest run of ones in a binary word. St001372The length of a longest cyclic run of ones of a binary word. St001419The length of the longest palindromic factor beginning with a one of a binary word. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000011The number of touch points (or returns) of a Dyck path. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000225Difference between largest and smallest parts in a partition. St000661The number of rises of length 3 of a Dyck path. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St000931The number of occurrences of the pattern UUU in a Dyck path. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001141The number of occurrences of hills of size 3 in a Dyck path. St001175The size of a partition minus the hook length of the base cell. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St000455The second largest eigenvalue of a graph if it is integral. St000617The number of global maxima of a Dyck path. St000929The constant term of the character polynomial of an integer partition. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St001586The number of odd parts smaller than the largest even part in an integer partition. St000117The number of centered tunnels of a Dyck path. St000142The number of even parts of a partition. St000143The largest repeated part of a partition. St000149The number of cells of the partition whose leg is zero and arm is odd. St000150The floored half-sum of the multiplicities of a partition. St000256The number of parts from which one can substract 2 and still get an integer partition. St000257The number of distinct parts of a partition that occur at least twice. St000292The number of ascents of a binary word. St000377The dinv defect of an integer partition. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000480The number of lower covers of a partition in dominance order. St000481The number of upper covers of a partition in dominance order. St000547The number of even non-empty partial sums of an integer partition. St000682The Grundy value of Welter's game on a binary word. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000877The depth of the binary word interpreted as a path. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St001022Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001091The number of parts in an integer partition whose next smaller part has the same size. St001092The number of distinct even parts of a partition. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001137Number of simple modules that are 3-regular in the corresponding Nakayama algebra. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St001172The number of 1-rises at odd height of a Dyck path. 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. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001234The number of indecomposable three dimensional modules with projective dimension one. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001252Half the sum of the even parts of a partition. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001423The number of distinct cubes in a binary word. St001524The degree of symmetry of a binary word. St001584The area statistic between a Dyck path and its bounce path. St001910The height of the middle non-run of a Dyck path. St001712The number of natural descents of a standard Young tableau. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. 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. St001525The number of symmetric hooks on the diagonal of a partition. St001657The number of twos in an integer partition. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St001596The number of two-by-two squares inside a skew partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000873The aix statistic of a permutation. St001651The Frankl number of a lattice. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St000895The number of ones on the main diagonal of an alternating sign matrix. St000234The number of global ascents of a permutation. St000376The bounce deficit of a Dyck path. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001498The normalised height of a Nakayama algebra with magnitude 1. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001587Half of the largest even part of an integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St000850The number of 1/2-balanced pairs in a poset. St001095The number of non-isomorphic posets with precisely one further covering relation. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St000137The Grundy value of an integer partition. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000567The sum of the products of all pairs of parts. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000936The number of even values of the symmetric group character corresponding to the partition. St000941The number of characters of the symmetric group whose value on the partition is even. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. 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. St001176The size of a partition minus its first part. St001383The BG-rank of an integer partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001561The value of the elementary symmetric function evaluated at 1. St001961The sum of the greatest common divisors of all pairs of parts. St000478Another weight of a partition according to Alladi. St000729The minimal arc length of a set partition. St001733The number of weak left to right maxima of a Dyck path. St000461The rix statistic of a permutation. St000221The number of strong fixed points of a permutation. St000315The number of isolated vertices of a graph. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St000907The number of maximal antichains of minimal length in a poset. St000241The number of cyclical small excedances. St000338The number of pixed points of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001114The number of odd descents of a permutation. St000273The domination number of a graph. St000544The cop number of a graph. St000916The packing number of a graph. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001829The common independence number of a graph. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001363The Euler characteristic of a graph according to Knill. St001826The maximal number of leaves on a vertex of a graph. St000363The number of minimal vertex covers of a graph. St001672The restrained domination number of a graph. St001342The number of vertices in the center of a graph. St001368The number of vertices of maximal degree in a graph. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St001280The number of parts of an integer partition that are at least two. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001479The number of bridges of a graph. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000989The number of final rises of a permutation. St000546The number of global descents of a permutation. St000910The number of maximal chains of minimal length in a poset. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000501The size of the first part in the decomposition of a permutation. St000542The number of left-to-right-minima of a permutation. St000990The first ascent of a permutation. St000260The radius of a connected graph. St000054The first entry of the permutation. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001877Number of indecomposable injective modules with projective dimension 2. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000513The number of invariant subsets of size 2 when acting with a permutation of given cycle type. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. 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. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000717The number of ordinal summands of a poset. St000649The number of 3-excedences of a permutation. St000732The number of double deficiencies of a permutation. St000740The last entry of a permutation. St000654The first descent of a permutation. St001570The minimal number of edges to add to make a graph Hamiltonian. St000056The decomposition (or block) number of a permutation. St001274The number of indecomposable injective modules with projective dimension equal to two. St001520The number of strict 3-descents. St000287The number of connected components of a graph. St000314The number of left-to-right-maxima of a permutation. St000335The difference of lower and upper interactions. St000991The number of right-to-left minima of a permutation. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. 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. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001481The minimal height of a peak of a Dyck path. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001052The length of the exterior of a permutation. St001096The size of the overlap set of a permutation. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001964The interval resolution global dimension of a poset. St001889The size of the connectivity set of a signed permutation. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001948The number of augmented double ascents of a permutation.
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!