Inversion sequences avoiding a quadruple of length-3 patterns

An inversion sequence is a sequence of integers e = e_0,e_1,...,e_n which satisfies 0 <= e_i <= i, for all i=0,1,...,n. For a set of patterns B, let I_n(B) be the set of inversion sequences of length n that avoid all the patterns from B. We say that two sets of patterns B and C are I-Wilf-equivalent if | I_n(B) | = | I_n(C) |, for all n>=0. In this paper, we show that the number of I-Wilf-equivalences among quadruples of length-3 patterns is at least 212 and at most 215, where three open cases remain.