Abstract
The number of permutations that do not contain, as a factor (subword), a given set of permutations II is studied. A new treatment of the case II={12[cdots, three dots, centered]k} is given and then some numerical data is presented for sets II consisting of permutations of length at most 4. Some large sets of Wilf-equivalent permutations are also given.