Related papers: The most concise recurrence formula for the sums o…

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…

Recently, E. Samsonadze (arXiv:2411.11859v1) has given an explicit formula for the sums of powers of integers $S_k(n) = 1^k +2^k +\cdots + n^k$. In this short note, we show that Samsonadze's formula corresponds to a well-known formula for…

The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…

In this paper, we derive a formula for the sums of powers of the first $n$ positive integers, $S_k(n)$, that involves the hyperharmonic numbers and the Stirling numbers of the second kind. Then, using an explicit representation for the…

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…

By applying the Newton-Gregory expansion to the polynomial associated with the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$, we derive a couple of infinite families of explicit formulas for $S_k(n)$. One of the families…

In 2011, W. Lang derived a novel, explicit formula for the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$ involving simultaneously the Stirling numbers of the first and second kind. In this note, we first recall and then…

Recently, Kargin et al. (arXiv:2008.00284 [math.NT]) obtained (among many other things) the following formula for the hyper-sums of powers of integers $S_k^{(m)}(n)$ \begin{equation*} S_k^{(m)}(n) = \frac{1}{m!} \sum_{i=0}^{m} (-1)^i…

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…

In this paper we study recurrences concerning the combinatorial sum $[n,r]_m=\sum_{k\equiv r (mod m)}\binom {n}{k}$ and the alternate sum $\sum_{k\equiv r (mod m)}(-1)^{(k-r)/m}\binom{n}{k}$, where m>0, $n\ge 0$ and r are integers. For…

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…

In this paper, we study the binomial sum $S_{n}(q):=% \overset{n}{\underset{k=0}{\sum }}a_{k}\binom{n}{k}\left( 1-q\right) ^{k}q^{n-k}$ for a given sequence $\left( a_{n}\right) $ of real or complex numbers. We express $S_{n}(q)$ in…

In this note we show a simple formula for the coefficients of the polynomial associated with the sums of powers of the terms of an arbitrary arithmetic progression. This formula consists of a double sum involving only ordinary binomial…

The power sum $1^n + 2^n + \cdots + x^n$ has been of interest to mathematicians since classical times. Johann Faulhaber, Jacob Bernoulli, and others who followed expressed power sums as polynomials in $x$ of degree $n+1$ with rational…

A sequence of rational numbers as a generalization of the sequence of Bernoulli numbers is introduced. Sums of products involving the terms of this generalized sequence are then obtained using an application of the Fa\`a di Bruno's formula.…

In this paper, we present several explicit formulas of the sums and hyper-sums of the powers of the first (n+1)-terms of a general arithmetic sequence in terms of Stirling numbers and generalized Bernoulli polynomials.

The following congruence for power sums, $S_n(p)$, is well known and has many applications: $1^n+2^n +\dots +p^n \equiv\begin{cases} -1 \text{ mod } p, & \text{ if } \ p-1 \ | \ n; 0 \text{ mod } p, & \text{ if } \ p-1 \ \not| \ n,…

In this note, we first review the novel approach to power sums put forward recently by Muschielok in arXiv:2207.01935v1, which can be summarized by the formula $S_m^{(a)}(n) = \sum_{k} c_{mk} \psi_k^{(a)}(n)$, where the $c_{mk}$'s are the…

We give a simple recursive formula to obtain the general sum of the first $N$ natural numbers to the $r$th power. Our method allows one to obtain the general formula for the $(r+1)$th power once one knows the general formula for the $r$th…

Let $\{B_n\}$, $\{B_n(x)\}$ and $\{E_n(x)\}$ be the Bernoulli numbers, Bernoulli polynomials and Euler polynomials, respectively. In this paper we mainly establish formulas for $\sum_{6\mid k-3}\binom nkB_{n-k}(x)$, $\sum_{6\mid k}\binom…