Trees with the same degree sequence and path numbers

We give an elementary procedure based on simple generating functions for constructing n (for any n ⩾ 2) pairwise non-isomorphic trees, all of which have the same degree sequence and the same number of paths of length k for all k ⩾ 1. The construction can also be used to give a sufficient condition for isomorphism of caterpillars.