Published June 29, 2026 | Version v11

Sums of powers via backward finite differences and Newton's formula

Description

Abstract

In this manuscript, we derive closed formulas for multifold sums of powers of integers by combining the backward Newton interpolation formula with hockey-stick identities for binomial coefficients. We further obtain representations of multifold sums of powers in terms of Stirling numbers of the second kind and Eulerian numbers. Finally, we provide Wolfram Mathematica programs for the efficient verification of the derived identities.

Related works

OEIS

  • A278075 — Triangle read by rows: T(n,k) = \sum_{j=0}^{k} (-1)^j \binom{k}{j} (0-j)^n. (2017)
  • A389570 — Triangle read by rows: T(n,k) = \sum_{j=0}^{k} (-1)^j \binom{k}{j} (1-j)^n. (2026)
  • A391068 — Triangle read by rows: T(n,k) = \sum_{j=0}^{k} (-1)^j \binom{k}{j} (2-j)^n. (2026)
  • A391210 — Triangle read by rows: T(n,k) = \sum_{j=0}^{k} (-1)^j \binom{k}{j} (3-j)^n. (2026)
  • A395604 — Triangle read by rows: T(n,k) = \sum_{j=0}^{k} (-1)^j \binom{k}{j} (4-j)^n. (2026)

Metadata

Files

SumsOfPowersViaBackwardFiniteDifferencesAndNewtonFormula.pdf

Files (283.4 kB)

Additional details

References