Some Explicit Formulas for Sums Involving the Binomial Coefficients with   the Falling Factorial
  Spivey presented a new approach to evaluate combinatorial sums by using finite differences. We present some closed forms for sums involving the binomial coefficients, Fibonacci and Lucas numbers in terms of the falling factorial. 
Ilker Akkus
math.CO