Related papers: A note on another approach on power sums

Recently, a novel method based on coding partitions [1]-[4] has been used to derive power series expansions to previously intractable problems. In this method the coefficients at $k$ are determined by summing the contributions made by each…

Taking inspiration from the work of Lanphier \cite{LANPHIER2022125716}, a generalized multivariable polynomial formulation for sums of alternating powers is given, as well as analogous sums. Furthermore, an analog of the Euler-Maclaurin…

In this paper, we investigate an example of summation of non-logarithmic singularities of a specific type in a two-dimensional non-linear sigma model. As a result of the study, we obtained an explicit formula, which, upon formal expansion…

We explore new types of binomial sums with Fibonacci and Lucas numbers. The binomial coefficients under consideration are $\frac{n}{n+k}\binom{n+k}{n-k}$ and $\frac{k}{n+k}\binom{n+k}{n-k}$. The identities are derived by relating the…

Tuenter [Fibonacci Quarterly 40 (2002), 175-180] and other authors have considered centred binomial sums of the form \[S_r(n) = \sum_k \binom{2n}{k}|n-k|^r,\] where $r$ and $n$ are non-negative integers. We consider sums of the form…

In arXiv:1603.03910 [math.NT] we introduced some $C_{n}$ in $Z/2[t]$ defined by a linear recurrence and showed that each $C_{n}$, $n\equiv 0 \bmod{4}$, is a sum of $C_{k}$, $k<n$. Combining this with results from arXiv:1508.07523 [math.NT]…

We improve a result of Bennett concerning certain sequences involving sums of powers of positive integers.

The present paper is devoted to power series of SP type, i.e. with coefficients that are syntactically sum-product combinations. Apart from their applications to analytic knot theory and the so-called "Volume Conjecture", SP-series are…

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.

We have found several summation formulas that extend Ramanujan's psi sum. First contains a parameter $\alpha=1/N$, $N$ is a positive integer, and transforms to $q$-beta integral in the limit $N\to\infty$. The other is a $q$-analogue of…

We analyze a weighted convolution of Catalan numbers $$ \sum_{k=0}^{n} \binom{2k}{k}\binom{2(n-k)}{n-k} a^k = \sum_{k=0}^{n} (k+1)(n-k+1) C_k C_{n-k} a^k, $$ emphasizing its combinatorial, analytic, and probabilistic aspects. We derive a…

An inverse polynomial has a Chebyshev series expansion 1/\sum(j=0..k)b_j*T_j(x)=\sum'(n=0..oo) a_n*T_n(x) if the polynomial has no roots in [-1,1]. If the inverse polynomial is decomposed into partial fractions, the a_n are linear…

In this article a new method of generating sums of like powers is presented.

We study sums of $k$-potent matrices. We show the conditions by which a complex matrix $A$ can be expressed as a sums of $k$-potent matrices. Also we obtain conditions by which a complex matrix $A$ can be expressed as a sum of finite order…

Some power series representations of the modified Bessel functions (McDonald functions $K_{\alpha}$) are derived using the relatively little known formalism of fractional derivatives. The resulting summation formulae are believed to be new.

We generalize the universal power series of Seleznev to several variables and we allow the coefficients to depend on parameters. Then, the approximable functions may depend on the same parameters. The universal approximation holds on…

Spivey presented a new approach to evaluate combinatorial sums by using finite differences. We present some closed forms for sums involving the binomial coefficients, Fibonacci and Lucas numbers in terms of the falling factorial.

We study M(n,k,r), the number of orbits of {(a_1,...,a_k)\in Z_n^k | a_1+...+a_k = r (mod n)} under the action of S_k. Equivalently, M(n,k,r) sums the partition numbers of an arithmetic sequence: M(n,k,r) = sum_{t \geq 0} p(n-1,k,r+nt),…

In the sixth chapter of his notebooks Ramanujan introduced a method of summing divergent series which assigns to the series the value of the associated Euler-MacLaurin constant that arises by applying the Euler-MacLaurin summation formula…

We prove a version of Gauss's Lemma. It recursively constructs polynomials {c_k} for k=0,1,...,m+n, in Z[a_i,A_i,b_j,B_j] for i=0,...,m, and j=0,1,...,n, having degree at most (m+n choose m) in each of the four variable sets, such that…