Published June 28, 2026 | Version v15

Newton's interpolation formula and sums of powers

Description

Abstract

In this manuscript, we derive closed formulas for multifold sums of powers of integers by combining the forward 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

  • https://oeis.org/A131689 — Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows, T(n, k) for 0 <= k <= n.
  • https://oeis.org/A028246 — Triangular array a(n,k) = (1/k)*Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*i^n; n >= 1, 1 <= k <= n, read by rows.
  • https://oeis.org/A038719 — Triangle T(n,k) (0 <= k <= n) giving number of chains of length k in partially ordered set formed from subsets of n-set by inclusion.
  • https://oeis.org/A391552 — Triangle read by rows: T(n,k) = Sum_{j=0..k} (-1)^(k-j) * binomial(k,j) * (3+j)^n.
  • https://oeis.org/A391633 — Triangle read by rows: T(n,k) = Sum_{j=0..k} (-1)^(k-j) * binomial(k,j) * (4+j)^n.
  • https://oeis.org/A391635 — Triangle read by rows: T(n,k) = Sum_{j=0..k} (-1)^(k-j) * binomial(k,j) * (5+j)^n.

Metadata

Files

NewtonsInterpolationFormulaAndSumsOfPowers.pdf

Files (294.6 kB)

Name Size Download all
md5:e0e2d0fc5a6aa3ba2b930b49b32dadb0
294.6 kB Preview Download

Additional details

References