Identifier
-
Mp00051:
Ordered trees
—to Dyck path⟶
Dyck paths
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
St001530: Dyck paths ⟶ ℤ
Values
[[]] => [1,0] => [1,0] => 1
[[],[]] => [1,0,1,0] => [1,0,1,0] => 2
[[[]]] => [1,1,0,0] => [1,1,0,0] => 1
[[],[],[]] => [1,0,1,0,1,0] => [1,0,1,0,1,0] => 3
[[],[[]]] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => 2
[[[]],[]] => [1,1,0,0,1,0] => [1,1,0,0,1,0] => 2
[[[],[]]] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => 2
[[[[]]]] => [1,1,1,0,0,0] => [1,1,1,0,0,0] => 1
[[],[],[],[]] => [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,1,0,1,0,1,0,0] => 3
[[],[[]],[]] => [1,0,1,1,0,0,1,0] => [1,1,0,1,0,0,1,0] => 3
[[],[[],[]]] => [1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,0] => 2
[[],[[[]]]] => [1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,0,0] => 2
[[[]],[],[]] => [1,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0] => 3
[[[]],[[]]] => [1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,0,0] => 2
[[[],[]],[]] => [1,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => 2
[[[[]]],[]] => [1,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0] => 2
[[[],[],[]]] => [1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0] => 3
[[[],[[]]]] => [1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,0,0] => 2
[[[[]],[]]] => [1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0] => 2
[[[[],[]]]] => [1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => 2
[[[[[]]]]] => [1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => 1
[[],[],[],[],[]] => [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,1,0,1,0,1,0,1,0,0] => 3
[[],[],[[]],[]] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,0,1,0] => 4
[[],[],[[],[]]] => [1,0,1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,1,0,0] => 4
[[],[],[[[]]]] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => 3
[[],[[]],[],[]] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,0,1,0,1,0] => 4
[[],[[]],[[]]] => [1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,0,0] => 3
[[],[[],[]],[]] => [1,0,1,1,0,1,0,0,1,0] => [1,0,1,1,0,1,0,0,1,0] => 3
[[],[[[]]],[]] => [1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,1,0,0,0,1,0] => 3
[[],[[],[],[]]] => [1,0,1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,1,0,0] => 2
[[],[[],[[]]]] => [1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,0,0,0] => 2
[[],[[[]],[]]] => [1,0,1,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,1,0,0] => 2
[[],[[[],[]]]] => [1,0,1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => 2
[[],[[[[]]]]] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => 2
[[[]],[],[],[]] => [1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0] => 4
[[[]],[],[[]]] => [1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,0,0] => 3
[[[]],[[]],[]] => [1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0,1,0] => 3
[[[]],[[],[]]] => [1,1,0,0,1,1,0,1,0,0] => [1,1,0,0,1,1,0,1,0,0] => 2
[[[]],[[[]]]] => [1,1,0,0,1,1,1,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => 2
[[[],[]],[],[]] => [1,1,0,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => 3
[[[[]]],[],[]] => [1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,0] => 3
[[[],[]],[[]]] => [1,1,0,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,0,0] => 2
[[[[]]],[[]]] => [1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,0,0] => 2
[[[],[],[]],[]] => [1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => 3
[[[],[[]]],[]] => [1,1,0,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,0,1,0] => 2
[[[[]],[]],[]] => [1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => 2
[[[[],[]]],[]] => [1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => 2
[[[[[]]]],[]] => [1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,0,0,0,0,1,0] => 2
[[[],[],[],[]]] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => 4
[[[],[],[[]]]] => [1,1,0,1,0,1,1,0,0,0] => [1,1,0,1,0,1,1,0,0,0] => 3
[[[],[[]],[]]] => [1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,1,0,0] => 3
[[[],[[],[]]]] => [1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,1,1,0,0,0] => 2
[[[],[[[]]]]] => [1,1,0,1,1,1,0,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => 2
[[[[]],[],[]]] => [1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => 3
[[[[]],[[]]]] => [1,1,1,0,0,1,1,0,0,0] => [1,1,1,0,0,1,1,0,0,0] => 2
[[[[],[]],[]]] => [1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => 2
[[[[[]]],[]]] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => 2
[[[[],[],[]]]] => [1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => 3
[[[[],[[]]]]] => [1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => 2
[[[[[]],[]]]] => [1,1,1,1,0,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => 2
[[[[[],[]]]]] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => 2
[[[[[[]]]]]] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => 1
[[],[],[],[],[],[]] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6
[[],[],[],[],[[]]] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 4
[[],[],[],[[]],[]] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => 4
[[],[],[],[[],[]]] => [1,0,1,0,1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,1,0,1,0,0] => 4
[[],[],[],[[[]]]] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => 3
[[],[],[[]],[],[]] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => 5
[[],[],[[]],[[]]] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => 3
[[],[],[[],[]],[]] => [1,0,1,0,1,1,0,1,0,0,1,0] => [1,0,1,1,0,1,0,1,0,0,1,0] => 5
[[],[],[[[]]],[]] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,1,0,1,0,0,0,1,0] => 4
[[],[],[[],[],[]]] => [1,0,1,0,1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,1,0,1,0,0] => 5
[[],[],[[],[[]]]] => [1,0,1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => 3
[[],[],[[[]],[]]] => [1,0,1,0,1,1,1,0,0,1,0,0] => [1,0,1,1,1,0,1,0,0,1,0,0] => 3
[[],[],[[[],[]]]] => [1,0,1,0,1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,1,0,1,0,0,0] => 4
[[],[],[[[[]]]]] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => 3
[[],[[]],[],[],[]] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => 5
[[],[[]],[],[[]]] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => 3
[[],[[]],[[]],[]] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0,1,0] => 4
[[],[[]],[[],[]]] => [1,0,1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,1,0,0,1,0,1,0,0] => 3
[[],[[]],[[[]]]] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => 3
[[],[[],[]],[],[]] => [1,0,1,1,0,1,0,0,1,0,1,0] => [1,0,1,1,0,1,0,0,1,0,1,0] => 4
[[],[[[]]],[],[]] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,1,0,0,0,1,0,1,0] => 4
[[],[[],[]],[[]]] => [1,0,1,1,0,1,0,0,1,1,0,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => 4
[[],[[[]]],[[]]] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => 3
[[],[[],[],[]],[]] => [1,0,1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,1,0,0,1,0] => 3
[[],[[],[[]]],[]] => [1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,0,1,1,0,1,0,0,0,1,0] => 3
[[],[[[]],[]],[]] => [1,0,1,1,1,0,0,1,0,0,1,0] => [1,0,1,1,1,0,0,1,0,0,1,0] => 3
[[],[[[],[]]],[]] => [1,0,1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,1,0,0,0,1,0] => 3
[[],[[[[]]]],[]] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,0,1,0] => 3
[[],[[],[],[],[]]] => [1,0,1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,1,0,0] => 2
[[],[[],[],[[]]]] => [1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => 3
[[],[[],[[]],[]]] => [1,0,1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,1,1,0,0,1,0,0] => 2
[[],[[],[[],[]]]] => [1,0,1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,1,1,0,1,0,0,0] => 2
[[],[[],[[[]]]]] => [1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => 2
[[],[[[]],[],[]]] => [1,0,1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,1,0,0] => 2
[[],[[[]],[[]]]] => [1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => 2
[[],[[[],[]],[]]] => [1,0,1,1,1,0,1,0,0,1,0,0] => [1,0,1,0,1,1,1,0,0,1,0,0] => 3
[[],[[[[]]],[]]] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,0,1,1,1,1,0,0,0,1,0,0] => 2
>>> Load all 196 entries. <<<
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
Description
The depth of a Dyck path. That is the depth of the corresponding Nakayama algebra with a linear quiver.
Map
switch returns and last double rise
Description
An alternative to the Adin-Bagno-Roichman transformation of a Dyck path.
This is a bijection preserving the number of up steps before each peak and exchanging the number of components with the position of the last double rise.
This is a bijection preserving the number of up steps before each peak and exchanging the number of components with the position of the last double rise.
Map
to Dyck path
Description
Return the Dyck path of the corresponding ordered tree induced by the recurrence of the Catalan numbers, see wikipedia:Catalan_number.
This sends the maximal height of the Dyck path to the depth of the tree.
This sends the maximal height of the Dyck path to the depth of the tree.
searching the database
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!