For a finite graph G with vertices {vi,..., ur}, a representation of G modulo n is a set {at,... ,ar} of distinct, nonnegative integers with 0 3. In the present paper we obtain upper and lower bounds for the representation number of a caterpillar, and get its exact value in some cases.