Identifier
Values
=>
Cc0014;cc-rep
[1]=>([],1)=>2 [1,2]=>([(0,1)],2)=>4 [2,1]=>([(0,1)],2)=>4 [1,2,3]=>([(0,2),(2,1)],3)=>8 [1,3,2]=>([(0,1),(0,2),(1,3),(2,3)],4)=>12 [2,1,3]=>([(0,1),(0,2),(1,3),(2,3)],4)=>12 [2,3,1]=>([(0,1),(0,2),(1,3),(2,3)],4)=>12 [3,1,2]=>([(0,1),(0,2),(1,3),(2,3)],4)=>12 [3,2,1]=>([(0,2),(2,1)],3)=>8 [1,2,3,4]=>([(0,3),(2,1),(3,2)],4)=>16 [1,2,4,3]=>([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)=>32 [1,4,3,2]=>([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)=>32 [2,1,3,4]=>([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)=>32 [2,1,4,3]=>([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)=>36 [2,3,4,1]=>([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)=>32 [3,2,1,4]=>([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)=>32 [3,4,1,2]=>([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)=>36 [3,4,2,1]=>([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)=>32 [4,1,2,3]=>([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)=>32 [4,3,1,2]=>([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)=>32 [4,3,2,1]=>([(0,3),(2,1),(3,2)],4)=>16 [1,2,3,4,5]=>([(0,4),(2,3),(3,1),(4,2)],5)=>32 [5,4,3,2,1]=>([(0,4),(2,3),(3,1),(4,2)],5)=>32 [1,2,3,4,5,6]=>([(0,5),(2,4),(3,2),(4,1),(5,3)],6)=>64 [6,5,4,3,2,1]=>([(0,5),(2,4),(3,2),(4,1),(5,3)],6)=>64 [1,2,3,4,5,6,7]=>([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)=>128 [7,6,5,4,3,2,1]=>([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)=>128
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 chains of a poset.
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.