Identifier
Values
[1,0] => [1,1,0,0] => [1,1,0,0] => [2,3,1] => 2
[1,0,1,0] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => [3,1,4,2] => 3
[1,1,0,0] => [1,1,1,0,0,0] => [1,1,1,0,0,0] => [2,3,4,1] => 2
[1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0] => [4,1,2,5,3] => 4
[1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,0,0] => [4,3,1,5,2] => 3
[1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0] => [2,4,1,5,3] => 3
[1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => [3,1,4,5,2] => 3
[1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => [2,3,4,5,1] => 2
[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,1,0,0] => [5,1,2,3,6,4] => 5
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,1,0,1,0,1,1,0,0,0] => [5,4,1,2,6,3] => 4
[1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,1,0,0] => [5,3,1,2,6,4] => 4
[1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,1,1,0,0,0] => [5,1,4,2,6,3] => 4
[1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [4,3,1,5,6,2] => 3
[1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => [2,5,1,3,6,4] => 4
[1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [1,1,1,0,0,1,1,0,0,0] => [2,5,4,1,6,3] => 3
[1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [3,1,5,2,6,4] => 3
[1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [4,1,2,5,6,3] => 4
[1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [5,3,4,1,6,2] => 3
[1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [2,3,5,1,6,4] => 3
[1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,4,1,5,6,3] => 3
[1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [3,1,4,5,6,2] => 3
[1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [2,3,4,5,6,1] => 2
[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,1,0,0] => [6,1,2,3,4,7,5] => 6
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [5,6,1,2,3,7,4] => 5
[1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [5,1,2,3,6,7,4] => 5
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => [2,3,4,6,1,7,5] => 3
[1,1,1,1,1,0,0,0,0,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] => [2,3,4,5,6,7,1] => 2
[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,0,1,0,1,0,1,0,1,0,1,1,0,0] => [7,1,2,3,4,5,8,6] => 7
[1,1,0,0,1,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,0,1,1,0,0,0] => [1,1,1,0,0,1,0,1,0,1,1,0,0,0] => [2,6,7,1,3,4,8,5] => 5
[1,1,1,0,0,1,0,1,1,0,0,0] => [1,1,1,1,0,0,1,0,1,1,0,0,0,0] => [1,1,1,1,0,0,1,0,1,1,0,0,0,0] => [2,7,6,5,1,3,8,4] => 4
[1,1,1,0,1,0,0,1,0,0,1,0] => [1,1,1,1,0,1,0,0,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [3,1,5,2,7,4,8,6] => 3
[1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,1] => 2
[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,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [8,1,2,3,4,5,6,9,7] => 8
[1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 2
[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,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [9,1,2,3,4,5,6,7,10,8] => 9
[1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,1] => 2
[] => [1,0] => [1,0] => [2,1] => 2
[1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,11,1] => 2
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       
Description
The length of the longest pattern of the form k 1 2...(k-1).
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.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
Map
Ringel
Description
The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.