  By means of the generating function method, a linear recurrence relation is
explicitly resolved. The solution is expressed in terms of the Stirling numbers
of both the first and the second kind. Two remarkable pairs of combinatorial
identities are established as applications, that contain some well-known
convolution formulae on Stirling numbers as special cases.
