- FindStat

Identifier

Mp00051: Ordered trees —to Dyck path⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St001346: Permutations ⟶ ℤ

Values

[[]] => [1,0] => [1,1,0,0] => [1,2] => 2
[[],[]] => [1,0,1,0] => [1,1,0,1,0,0] => [2,1,3] => 3
[[[]]] => [1,1,0,0] => [1,1,1,0,0,0] => [1,2,3] => 6
[[],[],[]] => [1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [3,2,1,4] => 4
[[],[[]]] => [1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [2,3,1,4] => 8
[[[]],[]] => [1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [3,1,2,4] => 8
[[[],[]]] => [1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [2,1,3,4] => 12
[[[[]]]] => [1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,2,3,4] => 24
[[],[],[],[]] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [4,3,2,1,5] => 5
[[],[],[[]]] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [3,4,2,1,5] => 10
[[],[[]],[]] => [1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [4,2,3,1,5] => 10
[[],[[],[]]] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [3,2,4,1,5] => 15
[[],[[[]]]] => [1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [2,3,4,1,5] => 30
[[[]],[],[]] => [1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [4,3,1,2,5] => 10
[[[]],[[]]] => [1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [3,4,1,2,5] => 20
[[[],[]],[]] => [1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [4,2,1,3,5] => 15
[[[[]]],[]] => [1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [4,1,2,3,5] => 30
[[[],[],[]]] => [1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [3,2,1,4,5] => 20
[[[],[[]]]] => [1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [2,3,1,4,5] => 40
[[[[]],[]]] => [1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [3,1,2,4,5] => 40
[[[[],[]]]] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [2,1,3,4,5] => 60
[[[[[]]]]] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => 120
[[],[],[],[],[]] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [5,4,3,2,1,6] => 6
[[],[],[],[[]]] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [4,5,3,2,1,6] => 12
[[],[],[[]],[]] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [5,3,4,2,1,6] => 12
[[],[],[[],[]]] => [1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [4,3,5,2,1,6] => 18
[[],[],[[[]]]] => [1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [3,4,5,2,1,6] => 36
[[],[[]],[],[]] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [5,4,2,3,1,6] => 12
[[],[[]],[[]]] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => [4,5,2,3,1,6] => 24
[[],[[],[]],[]] => [1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => [5,3,2,4,1,6] => 18
[[],[[[]]],[]] => [1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [5,2,3,4,1,6] => 36
[[],[[],[],[]]] => [1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => [4,3,2,5,1,6] => 24
[[],[[],[[]]]] => [1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => [3,4,2,5,1,6] => 48
[[],[[[]],[]]] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [4,2,3,5,1,6] => 48
[[],[[[],[]]]] => [1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [3,2,4,5,1,6] => 72
[[],[[[[]]]]] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [2,3,4,5,1,6] => 144
[[[]],[],[],[]] => [1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [5,4,3,1,2,6] => 12
[[[]],[],[[]]] => [1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => [4,5,3,1,2,6] => 24
[[[]],[[]],[]] => [1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [5,3,4,1,2,6] => 24
[[[]],[[],[]]] => [1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,0,1,1,0,1,0,0,0] => [4,3,5,1,2,6] => 36
[[[]],[[[]]]] => [1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => [3,4,5,1,2,6] => 72
[[[],[]],[],[]] => [1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => [5,4,2,1,3,6] => 18
[[[[]]],[],[]] => [1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [5,4,1,2,3,6] => 36
[[[],[]],[[]]] => [1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => [4,5,2,1,3,6] => 36
[[[[]]],[[]]] => [1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => [4,5,1,2,3,6] => 72
[[[],[],[]],[]] => [1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => [5,3,2,1,4,6] => 24
[[[],[[]]],[]] => [1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => [5,2,3,1,4,6] => 48
[[[[]],[]],[]] => [1,1,1,0,0,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [5,3,1,2,4,6] => 48
[[[[],[]]],[]] => [1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [5,2,1,3,4,6] => 72
[[[[[]]]],[]] => [1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [5,1,2,3,4,6] => 144
[[[],[],[],[]]] => [1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [4,3,2,1,5,6] => 30
[[[],[],[[]]]] => [1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => [3,4,2,1,5,6] => 60
[[[],[[]],[]]] => [1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => [4,2,3,1,5,6] => 60
[[[],[[],[]]]] => [1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => [3,2,4,1,5,6] => 90
[[[],[[[]]]]] => [1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => [2,3,4,1,5,6] => 180
[[[[]],[],[]]] => [1,1,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [4,3,1,2,5,6] => 60
[[[[]],[[]]]] => [1,1,1,0,0,1,1,0,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => [3,4,1,2,5,6] => 120
[[[[],[]],[]]] => [1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => [4,2,1,3,5,6] => 90
[[[[[]]],[]]] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [4,1,2,3,5,6] => 180
[[[[],[],[]]]] => [1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [3,2,1,4,5,6] => 120
[[[[],[[]]]]] => [1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => [2,3,1,4,5,6] => 240
[[[[[]],[]]]] => [1,1,1,1,0,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [3,1,2,4,5,6] => 240
[[[[[],[]]]]] => [1,1,1,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [2,1,3,4,5,6] => 360
[[[[[[]]]]]] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,2,3,4,5,6] => 720

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

click to show known generating functions

$F_{2} = q^{2}$

$F_{3} = q^{3} + q^{6}$

$F_{4} = q^{4} + 2\ q^{8} + q^{12} + q^{24}$

$F_{5} = q^{5} + 3\ q^{10} + 2\ q^{15} + 2\ q^{20} + 2\ q^{30} + 2\ q^{40} + q^{60} + q^{120}$

$F_{6} = q^{6} + 4\ q^{12} + 3\ q^{18} + 5\ q^{24} + q^{30} + 5\ q^{36} + 4\ q^{48} + 3\ q^{60} + 4\ q^{72} + 2\ q^{90} + 2\ q^{120} + 2\ q^{144} + 2\ q^{180} + 2\ q^{240} + q^{360} + q^{720}$

Description

The number of parking functions that give the same permutation.
A parking function

$(a_1,\dots,a_n)$ is a list of preferred parking spots of

$n$ cars entering a one-way street. Once the cars have parked, the order of the cars gives a permutation of

$\{1,\dots,n\}$ . This statistic records the number of parking functions that yield the same permutation of cars.

Map

to 132-avoiding permutation

Description

Sends a Dyck path to a 132-avoiding permutation.
This bijection is defined in [1, Section 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.