We consider terms in which some patterns can be repeated n times. n is
an integer variable which is part of the syntax of the terms (and hen
ce may occur more than once in them). We show that unification of such
terms is decidable and finitary, extending Chen and Hsiang's result o
n p-term unification. Finally, extending slightly the syntax yields an
undecidable unification problem.