Related papers: How to sum powers of balancing numbers efficiently

We apply an integral inequality to obtain a rigorous apriori estimate of the accuracy of the partial sum to the power series solution of the celebrated Riccati-Bernoulli differential equation

By using an asymptotic formula known for the numbers of Euler and Bernoulli it is possible to obtain an explicit expression of the nth digit of $\pi$ in decimal or in binary, it also makes it possible to obtain the $n^{\rm th}$ digit of…

Let $F_n(k)$ be the generalized Fibonacci number defined by (with $F_i(k)$ abbreviated to $F_i$): $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$, for $n \geq k$, and the initial values $(F_0,F_1,...,F_{k-1})$. Let $B_n(k,j)$ be $F_n(k)$ with…

We explicitly determine the Ap\'ery limits for the sums of powers of binomial coefficients. As an application, we prove a weak version of Franel's conjecture on the order of the recurrences for these sequences. Namely, we prove the…

In this paper, we study the weighted sums of multiple t-values and of multiple t-star values at even arguments. Some general weighted sum formulas are given, where the weight coefficients are given by (symmetric) polynomials of the…

We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.

We obtain closed-form expressions for all sums of the form \mbox{$\sum_{k = 1}^n {F_{mk}{}^4 }$} and \mbox{$\sum_{k = 1}^n {L_{mk}{}^4 }$} and their alternating versions, where $F_i$ and $L_i$ denote Fibonacci and Lucas numbers…

Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…

A recurrence relations for sums of powers of complex functions can be written as a system of linear equation AX=B. Using properties of determinant and Cramer's rule for solving systems of linear equation, this paper presents an absolutely…

Recently, the properties of a binomial sum related to the multi-link inverted pendulum enumeration problem have been studied. In this note, we establish bounds for this binomial sum.

The article presents mathematical generalization of results which originated as solutions of practical problems, in particular, the modeling of transitional processes in electrical circuits and problems of resource allocation. However, the…

From an identity connecting a combinatorial sum and Legendre polynomials, we derive closed forms for a number of combinatorial sums. Some of them are obtained via results about the integrals of functions associated with Legendre…

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p \ge 11$ and integer $r\ge 2$, we prove that $$ \sum\limits_{\begin{smallmatrix}…

We study the problem of recovering a collection of $n$ numbers from the evaluation of $m$ power sums. This yields a system of polynomial equations, which can be underconstrained ($m < n$), square ($m = n$), or overconstrained ($m > n$).…

The explicit formulas expressing harmonic sums via alternating Euler sums (colored multiple zeta values) are given, and some explicit evaluations are given as applications.

In this paper, we investigate sums of three Fibonacci numbers that can be expressed as concatenations of three repdigits in base $b$, where $b\ge 2$ is an integer. We prove that for bases $2\le b\le 10$, only finitely many such sums exist,…

We determine all perfect powers that can be written as the sum of at most 10 consecutive squares.

In the context of the Frobenius coin problem, given two relatively prime positive integers $a$ and $b$, the set of nonrepresentable numbers consists of positive integers that cannot be expressed as nonnegative integer combination of $a$ and…

We present here a large collection of harmonic and quadratic harmonic sums, that can be useful in applied questions, e.g., probabilistic ones. We find closed-form formulae, that we were not able to locate in the literature.

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_0 = 0, F_1 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for $n \geq 0$. In this paper, we solve all powers of two which are sums of four Fibonacci numbers with a few exceptions that we…