Faulhaber's Theorem on Power Sums

Let $$ S_{m,n}(q):=\sum_{k=1}^{n}\frac{1-q^{2k}}{1-q^2} (\frac{1-q^k}{1-q})^{m-1}q^{\frac{m+1}{2}(n-k)}. $$ Generalizing the formulas of Warnaar and Schlosser, we prove that there exist polynomials $P_{m,k}(q)\in\mathbb{Z}[q]$ such that $$ S_{2m+1,n}(q) =\sum_{k=0}^{m}(-1)^kP_{m,k}(q) \frac{(1-q^n)^{m+1-k}(1-q^{n+1})^{m+1-k}q^{kn}} {(1-q^2)(1-q)^{2m-3k}\prod_{i=0}^{k}(1-q^{m+1-i})}, $$ and solve a problem raised by Schlosser. We also show that there is a similar f...

In this paper some generalizations of the sum of powers of natural numbers is considered. In particular, the class of sums whose generating function is the power of the generating function for the classical sums of powers is studying. The so-called binomial sums are also considered. The problem of constructing polynomials that allow to calculate the values of the corresponding sums in certain cases is solved.

For integer $k \geq 1$, let $S_k(n)$ denote the sum of the $k$th powers of the first $n$ positive integers $1^k + 2^k + \cdots + n^k$. 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 $k$th row of the integer sequence A304330, which is closely related to the central factorial numbers of the second kind with even indices. Furthermore, we provide an alternative proof of Knuth's formula for $S_{2k}(n)...

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 reflection relation that the Appell polynomials can be described by Faulhaber-type polynomials, which arise from a quadratic variable substitution. Furthermore, the coefficients of the latter polynomials are given by values of derivatives of gener...

Following an idea due to Euler, we evaluate the alternating sums of powers of consrcutive integers.

This is a collection of definitions, notations and proofs for the Bernoulli numbers $B_n$ appearing in formulas for the sum of integer powers, some of which can be found scattered in the large related historical literature in French, English and German. We provide elementary proofs for the original convention with ${\mathcal B}_1=1/2$ and also for the current convention with $B_1=-1/2$, using only the binomial theorem and the concise Blissard symbolic (umbral) notation.

The aim of this note is to provide a simple proof of some well-known identities and recurrences relating classical Bernoulli and Euler numbers by using the Abel sum of the divergent series $\sum_{n=0}^\infty (-1)^{n} (n+1)^k$, $k$ a positive integers. Special attention is placed on the fact that the numerical value of these sums is determined by the linearity of the summation method involved.

For non-negative integers $r$ and $m$, let $S_m^{(r)}(n)$ denote the $r$-fold summation (or hyper-sum) over the first $n$ positive integers to the $m$th powers, with the initial condition $S_m^{(0)}(n) =n^m$. In this paper, we derive a new determinantal formula for $S_m^{(r)}(n)$. Specifically, we show that, for all integers $r\geq 0$ and $m \geq 1$, $S_m^{(r)}(n)$ is proportional to $S_1^{(r)}(n)$ times the determinant of a lower Hessenberg matrix of order $m-1$ involving th...

In this paper we introduce the generalization of Multi Poly-Euler polynomials and we investigate some relationship involving Multi Poly-Euler polynomials. Obtaining a closed formula for generalization of Multi Poly-Euler numbers therefore seems to be a natural and important problem.

Let n,k be the positive integers, and let S_{k}(n) be the sums of the k-th power of positive integers up to n. By means of that we consider the evaluation of the sum of more general series by Bernstein polynomials. Additionally we show the reality of our idea with some examples.