Processing math: 100%

Identifier
Values
[1,0] => [1,0] => 3
[1,0,1,0] => [1,0,1,0] => 4
[1,1,0,0] => [1,1,0,0] => 6
[1,0,1,0,1,0] => [1,0,1,0,1,0] => 5
[1,0,1,1,0,0] => [1,1,0,1,0,0] => 7
[1,1,0,0,1,0] => [1,1,0,0,1,0] => 7
[1,1,0,1,0,0] => [1,0,1,1,0,0] => 6
[1,1,1,0,0,0] => [1,1,1,0,0,0] => 10
[1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => 6
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0] => 8
[1,0,1,1,0,0,1,0] => [1,1,0,1,0,0,1,0] => 8
[1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,0] => 7
[1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,0,0] => 11
[1,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0] => 8
[1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,0,0] => 11
[1,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => 7
[1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0] => 7
[1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,0,0] => 9
[1,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0] => 11
[1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0] => 9
[1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => 9
[1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => 15
[1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => 7
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0] => 9
[1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,0,1,0] => 9
[1,0,1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,1,0,0] => 8
[1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => 12
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,0,1,0,1,0] => 9
[1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,0,0] => 12
[1,0,1,1,0,1,0,0,1,0] => [1,0,1,1,0,1,0,0,1,0] => 8
[1,0,1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,1,0,0] => 8
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,0,0,0] => 10
[1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,1,0,0,0,1,0] => 12
[1,0,1,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,1,0,0] => 10
[1,0,1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => 10
[1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => 16
[1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0] => 9
[1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,0,0] => 12
[1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0,1,0] => 12
[1,1,0,0,1,1,0,1,0,0] => [1,1,0,0,1,1,0,1,0,0] => 10
[1,1,0,0,1,1,1,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => 16
[1,1,0,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => 8
[1,1,0,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,0,0] => 10
[1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => 8
[1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => 8
[1,1,0,1,0,1,1,0,0,0] => [1,1,0,1,0,1,1,0,0,0] => 10
[1,1,0,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,0,1,0] => 10
[1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,1,0,0] => 10
[1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,1,1,0,0,0] => 9
[1,1,0,1,1,1,0,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => 12
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,0] => 12
[1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,0,0] => 16
[1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => 10
[1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => 10
[1,1,1,0,0,1,1,0,0,0] => [1,1,1,0,0,1,1,0,0,0] => 13
[1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => 10
[1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => 9
[1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => 10
[1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => 13
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,0,0,0,0,1,0] => 16
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => 13
[1,1,1,1,0,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => 12
[1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => 13
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => 21
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 number of indecomposable modules with projective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path.
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.