Identifier
Values
[1] => ([],1) => ([(0,1)],2) => 0
[1,2] => ([(0,1)],2) => ([(0,2),(2,1)],3) => 0
[2,1] => ([(0,1)],2) => ([(0,2),(2,1)],3) => 0
[1,2,3] => ([(0,2),(2,1)],3) => ([(0,3),(2,1),(3,2)],4) => 0
[1,3,2] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => 2
[2,1,3] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => 2
[2,3,1] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => 2
[3,1,2] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => 2
[3,2,1] => ([(0,2),(2,1)],3) => ([(0,3),(2,1),(3,2)],4) => 0
[1,2,3,4] => ([(0,3),(2,1),(3,2)],4) => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[2,1,4,3] => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(0,6),(1,8),(2,8),(3,7),(4,7),(6,1),(6,2),(7,5),(8,3),(8,4)],9) => 3
[3,4,1,2] => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(0,6),(1,8),(2,8),(3,7),(4,7),(6,1),(6,2),(7,5),(8,3),(8,4)],9) => 3
[4,3,2,1] => ([(0,3),(2,1),(3,2)],4) => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[5,4,3,2,1] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 0
[6,5,4,3,2,1] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 0
[1,2,3,4,5,6,7] => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([(0,7),(2,4),(3,2),(4,6),(5,3),(6,1),(7,5)],8) => 0
[7,6,5,4,3,2,1] => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([(0,7),(2,4),(3,2),(4,6),(5,3),(6,1),(7,5)],8) => 0
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 cardinality of the Frattini sublattice of a lattice.
The Frattini sublattice is the intersection of all proper maximal sublattices of the lattice.
Map
order ideals
Description
The lattice of order ideals of a poset.
An order ideal $\mathcal I$ in a poset $P$ is a downward closed set, i.e., $a \in \mathcal I$ and $b \leq a$ implies $b \in \mathcal I$. This map sends a poset to the lattice of all order ideals sorted by inclusion with meet being intersection and join being union.
Map
pattern poset
Description
The pattern poset of a permutation.
This is the poset of all non-empty permutations that occur in the given permutation as a pattern, ordered by pattern containment.