Identifier
Values
[] => [] => [1,0] => [1,0] => 0
[[]] => [1,0] => [1,1,0,0] => [1,0,1,0] => 1
[[],[]] => [1,0,1,0] => [1,1,0,1,0,0] => [1,1,0,0,1,0] => 1
[[],[],[]] => [1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,1,0,0,1,1,0,0] => 2
[[],[[]]] => [1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,0] => 3
[[],[],[],[]] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => 2
[[],[],[[]]] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,0,0] => 4
[[[],[],[]]] => [1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0] => 3
[[],[],[],[],[]] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => 3
[[],[],[],[[]]] => [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,1,1,0,0,0,1,1,0,0] => 5
[[],[],[[]],[]] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [1,1,1,0,0,1,1,0,0,0,1,0] => 5
[[],[[]],[],[]] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,1,1,0,0,1,0,0] => 5
[[],[[],[]],[]] => [1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,0,0,0,1,1,0,0] => 6
[[],[[],[],[]]] => [1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => 3
[[[],[],[],[]]] => [1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => 4
[[[],[],[[]]]] => [1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => 5
[[],[],[],[],[],[]] => [1,0,1,0,1,0,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,1,1,0,0,0] => 3
[[],[],[],[],[[]]] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,1,1,0,0,0] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0] => 6
[[],[],[],[[]],[]] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0,1,0] => 5
[[],[],[[]],[],[]] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,1,1,0,0,1,1,0,0,0] => 7
[[],[],[[]],[[]]] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,1,1,0,0,0] => [1,0,1,1,1,0,0,1,1,0,0,0,1,0] => 8
[[],[],[[],[]],[]] => [1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,0,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,0,0,0,1,1,1,0,0,0] => 7
[[],[],[[],[],[]]] => [1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,1,0,0,0] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0] => 4
[[],[[]],[],[[]]] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,1,1,0,0,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,1,0,0] => 7
[[],[[],[],[],[]]] => [1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0,1,1,0,0] => 5
[[],[[],[],[[]]]] => [1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,0,1,1,0,0,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0] => 6
[[],[[[],[]],[]]] => [1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,1,0,1,0,0,1,0,0,0] => [1,1,0,1,1,0,0,0,1,1,0,0,1,0] => 7
[[[],[],[]],[],[]] => [1,1,0,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,0,1,0,0,1,0,1,0,0] => [1,1,1,0,0,0,1,1,1,0,0,1,0,0] => 5
[[[],[],[],[]],[]] => [1,1,0,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,1,0,0,1,0,0] => [1,1,1,0,0,1,1,0,0,0,1,1,0,0] => 6
[[[],[],[],[],[]]] => [1,1,0,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,1,0,0,0] => [1,1,1,0,0,0,1,1,0,0,1,1,0,0] => 4
[[[],[],[],[[]]]] => [1,1,0,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,1,0,1,1,0,0,0,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => 6
[[[[],[],[],[]]]] => [1,1,1,0,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,1,0,0,0,0] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0] => 5
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 number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
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.
Map
inverse zeta map
Description
The inverse zeta map on Dyck paths.
See its inverse, the zeta map Mp00030zeta map, for the definition and details.