An old conjecture of Erdős and Graham states that only finitely many integer squares could be obtained from product of disjoint blocks of consecutive integers of length greater than or equal to four. It is known by counterexamples that the conjecture is false for product of disjoint blocks of four and five consecutive integers. In this talk, we present new algorithms generating new polynomial parametrizations that extend the polynomial parametrization given by Bennett and Luijk (Indag Math (N.S.) 23(1–2):123–127, 2012). Moreover, we produce the first examples of integer squares obtained from product of disjoint blocks of consecutive integers such that each block has length six or seven.