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

We give an algorithm counting the permutations that avoid a fixed pattern of the following form: the direct sum of an increasing pattern and 231. The first members of the family are 1342 and 12453. For each member the algorithm uses polynomially many operations and stored integers, with degrees that