Related papers: An algorithm for the Faulhaber polynomials

Sum of powers 1^p+...+n^p, with n and p being natural numbers and n>=1, can be expressed as a polynomial function of n of degree p+1. Such representations are often called Faulhaber formulae. A simple recursive algorithm for computing…

In this note we consider the theorem established in arXiv:1912.07171 concerning the sums of powers of the first $n$ positive integers, $S_k = 1^k + 2^k + \cdots + n^k$, and show that it can be used to demonstrate the classical theorem of…

For $k$ a positive integer let $S_k(n) = 1^k + 2^k + \cdots + n^k$, i.e., $S_k(n)$ is the sum of the first $k$-th powers. Faulhaber conjectured (later proved by Jacobi) that for $k$ odd, $S_k(n)$ could be written as a polynomial of…

About four centuries ago, Johann Faulhaber developed formulas for the power sum $1^n + 2^n + \cdots + m^n$ in terms of $m(m+1)/2$. The resulting polynomials are called the Faulhaber polynomials. We first give a short survey of Faulhaber's…

Faulhaber's formula expresses the sum of the first $n$ positive integers, each raised to an integer power $p\geq 0$, as a polynomial in $n$ of degree $p+1$. Ramanujan expressed this sum for $p\in\{\frac12,\frac32,\frac52,\frac72\}$ as the…

Early 17th-century mathematical publications of Johann Faulhaber contain some remarkable theorems, such as the fact that the $r$-fold summation of $1^m,2^m,...,n^m$ is a polynomial in $n(n+r)$ when $m$ is a positive odd number. The present…

We observe that the classical Faulhaber's theorem on sums of odd powers also holds for an arbitrary arithmetic progression, namely, the odd power sums of any arithmetic progression $a+b, a+2b, ..., a+nb$ is a polynomial in $na+n(n+1)b/2$.…

Let ``Faulhaber's formula'' refer to an expression for the sum of powers of integers written with terms in n(n+1)/2. Initially, the author used Faulhaber's formula to explain why odd Bernoulli numbers are equal to zero. Next, Cereceda gave…

For integer $k \geq 0$, let $S_k$ denote the sum of the $k$th powers of the first $n$ positive integers $1^k + 2^k + \cdots + n^k$. For any given $k$, the power sum $S_k$ can in principle be determined by differentiating $k$ times (with…

We give a new identity involving Bernoulli polynomials and combinatorial numbers. This provides, in particular, a Faulhaber-like formula for sums of the form $1^m (n-1)^m + 2^m (n-2)^m + \cdots + (n-1)^m 1^m$ for positive integers $m$ and…

The problem of finding formulas for sums of powers of natural numbers has been of interest to mathematicians for many centuries. Among these is Faulhaber's well-known formula expressing the power sums as polynomials whose coefficients…

In modern usage the Bernoulli numbers and Bernoulli polynomials follow Euler's approach and are defined using generating functions. We consider the functional equation $f(x)+x^k=f(x+1)$ and show that a solution can be derived from…

This paper sets the groundwork for the consideration of families of recursively defined polynomials and rational functions capable of describing the Bernoulli numbers. These families of functions arise from various recursive definitions of…

Denote by $\Sigma n^m$ the sum of the $m$-th powers of the first $n$ positive integers $1^m+2^m+\ldots +n^m$. Similarly let $\Sigma^r n^m$ be the $r$-fold sum of the $m$-th powers of the first $n$ positive integers, defined such that…

Using combinatorial techniques, we derive a recurrence identity that expresses an exponential power sum with negative powers in terms of another exponential power sum with positive powers. Consequently, we derive a formula for the power sum…

For integer $k \geq 1$, let $S_k(n)$ denote the sum of the $k$th powers of the first $n$ positive integers. In this paper, we derive a new formula expressing $2^{2k}$ times $S_{2k}(n)$ as a sum of $k$ terms involving the numbers in the…

For a positive integer $n$, let $p(n)$ be the number of ways to express $n$ as a sum of positive integers. In this note, we revisit the derivation of the Rademacher's convergent series for $p(n)$ in a pedagogical way, with all the details…

The main purpose of this paper is to study generalized (self-) reciprocal Appell polynomials, which play a certain role in connection with Faulhaber-type polynomials. More precisely, we show for any Appell sequence when satisfying a…

For a positive integer $d$, let $p_d(n) := 0^d + 1^d + 2^d + \cdots + n^d$; i.e., $p_d(n)$ is the sum of the first $d^{\mathrm{th}}$-powers up to $n$. It's well known that $p_d(n)$ is a polynomial of degree $d+1$ in $n$. While this is…

We present a simple elementary recursive representation of the so called Faulhaber series $\sum_{k=1}^n k^N$ for integer $n$ and $N$, without reference to Bernoulli numbers or polynomials.