Summation algorithms for Stirling number identities (Q2469233)

The author considers a class of sequences defined by triangular recurrence equations. This class contains Stirling numbers and Eulerian numbers of both kinds, and hypergeometric multiples. The author gives a sufficient criterion for sums over such sequences to obey a recurrence equation and presents some algorithms for computing such recurrence equations efficiently, the algorithms can be used for verifying many known summation identities on Stirling numbers and for discovering new identities.