e/Separable permutation

Information
has gloss	eng: In combinatorics, a separable permutation is a permutation that can be obtained from the trivial permutation 1 by direct sums and skew sums. Separable permutations can also be characterized as the permutations that contain neither 2413 nor 3142. They are enumerated by the Schröder numbers.
lexicalization	eng: separable permutation
instance of	(noun) act of changing the lineal order of objects in a group permutation