Identifier
Values
[3] => [1,0,1,0,1,0] => [.,[.,[.,.]]] => ([(0,2),(2,1)],3) => 3
[2,1] => [1,0,1,1,0,0] => [.,[[.,.],.]] => ([(0,2),(2,1)],3) => 3
[1,1,1] => [1,1,0,1,0,0] => [[[.,.],.],.] => ([(0,2),(2,1)],3) => 3
[4] => [1,0,1,0,1,0,1,0] => [.,[.,[.,[.,.]]]] => ([(0,3),(2,1),(3,2)],4) => 4
[3,1] => [1,0,1,0,1,1,0,0] => [.,[.,[[.,.],.]]] => ([(0,3),(2,1),(3,2)],4) => 4
[2,1,1] => [1,0,1,1,0,1,0,0] => [.,[[[.,.],.],.]] => ([(0,3),(2,1),(3,2)],4) => 4
[1,1,1,1] => [1,1,0,1,0,1,0,0] => [[[[.,.],.],.],.] => ([(0,3),(2,1),(3,2)],4) => 4
[5] => [1,0,1,0,1,0,1,0,1,0] => [.,[.,[.,[.,[.,.]]]]] => ([(0,4),(2,3),(3,1),(4,2)],5) => 5
[4,1] => [1,0,1,0,1,0,1,1,0,0] => [.,[.,[.,[[.,.],.]]]] => ([(0,4),(2,3),(3,1),(4,2)],5) => 5
[3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [.,[.,[[[.,.],.],.]]] => ([(0,4),(2,3),(3,1),(4,2)],5) => 5
[2,1,1,1] => [1,0,1,1,0,1,0,1,0,0] => [.,[[[[.,.],.],.],.]] => ([(0,4),(2,3),(3,1),(4,2)],5) => 5
[1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [[[[[.,.],.],.],.],.] => ([(0,4),(2,3),(3,1),(4,2)],5) => 5
[6] => [1,0,1,0,1,0,1,0,1,0,1,0] => [.,[.,[.,[.,[.,[.,.]]]]]] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 6
[5,1] => [1,0,1,0,1,0,1,0,1,1,0,0] => [.,[.,[.,[.,[[.,.],.]]]]] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 6
[4,1,1] => [1,0,1,0,1,0,1,1,0,1,0,0] => [.,[.,[.,[[[.,.],.],.]]]] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 6
[3,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,0] => [.,[.,[[[[.,.],.],.],.]]] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 6
[2,1,1,1,1] => [1,0,1,1,0,1,0,1,0,1,0,0] => [.,[[[[[.,.],.],.],.],.]] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 6
[1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,0] => [[[[[[.,.],.],.],.],.],.] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 6
[7] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [.,[.,[.,[.,[.,[.,[.,.]]]]]]] => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 7
[6,1] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [.,[.,[.,[.,[.,[[.,.],.]]]]]] => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 7
[5,1,1] => [1,0,1,0,1,0,1,0,1,1,0,1,0,0] => [.,[.,[.,[.,[[[.,.],.],.]]]]] => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 7
[4,1,1,1] => [1,0,1,0,1,0,1,1,0,1,0,1,0,0] => [.,[.,[.,[[[[.,.],.],.],.]]]] => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 7
[3,1,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,1,0,0] => [.,[.,[[[[[.,.],.],.],.],.]]] => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 7
[2,1,1,1,1,1] => [1,0,1,1,0,1,0,1,0,1,0,1,0,0] => [.,[[[[[[.,.],.],.],.],.],.]] => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 7
[1,1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => [[[[[[[.,.],.],.],.],.],.],.] => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 7
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 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice.
Map
parallelogram polyomino
Description
Return the Dyck path corresponding to the partition interpreted as a parallogram polyomino.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.
Map
logarithmic height to pruning number
Description
Francon's map from Dyck paths to binary trees.
This bijection sends the logarithmic height of the Dyck path, St000920The logarithmic height of a Dyck path., to the pruning number of the binary tree, St000396The register function (or Horton-Strahler number) of a binary tree.. The implementation is a literal translation of Knuth's [2].
Map
to poset
Description
Return the poset obtained by interpreting the tree as a Hasse diagram.