Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231

We give an exact algorithm counting the permutations that avoid a fixed pattern from the following family: the direct sum of an increasing pattern and the pattern 231. The first members of the family are 1342 and 12453. For each member, the algorithm computes the number of avoiding permutations of e