  We enumerate permutations that avoid all but one of the $k$ patterns of
length $k$ starting with a monotone increasing subsequence of length $k-1$. We
compare the size of such permutation classes to the size of the class of
permutations avoiding the monotone increasing subsequence of length $k-1$.
