Avoiding consecutive patterns in permutations

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