We develop a new method for the discovery and proof of recurrences for sums of binomial coefficients which is easy to apply and consists of justifying that it is enough to verify the recurrence for finitely many values of n, provided an extra condition is satisfied. This method can easily be implemented by using software. We also consider the case of a Riordan array instead of Pascal's triangle.