INSENC: This package accompanies ”Finding regular insertion encodings for permutation classes”. In that paper you will find a description of the algorithm the package uses. It has been tested with Maple 11. What INSENC can do: If the class of permutations avoiding a particular set B of permutations has a regular insertion encoding (which INSENC will determine as soon as you type in B), then INSENC can compute the (necessarily rational) generating function for the class.