Haglund’s combinatorial definition of the Hilbert series of the Garsia-Haiman module allows us to write the series as a generating function of standard fillings of a Ferrers diagram. In this talk we use the combinatorial definition and present a recursion for the Hilbert series indexed by partitions of two or three columns. The recursion allows us to combinatorially prove a factorization of the polynomials.