An inversion sequence of length n is a word e = e0 en which satisfies, for each i 2 [n] = f0; 1; : : : ; ng, the inequality 0 ei i. In this paper, by generating tree tools, an explicit formula is found for the generating function for the number of inversion sequences of length n that avoid 0021, which resolves the conjecture of Hong and Li posed in the recent paper [Electron. J. Combin. 29 (2022) #4.37].