English
Related papers

Related papers: How to sum powers of balancing numbers efficiently

200 papers

A new family of generalized Pell numbers was recently introduced and studied by Br\'od \cite{Dorota}. These number possess, as Fibonacci numbers, a Binet formula. Using this, partial sums of arbitrary powers of generalized Pell numbers can…

Number Theory · Mathematics 2020-10-28 Helmut Prodinger

We evaluate various binomial sums involving the powers of Fibonacci and Lucas numbers.

Combinatorics · Mathematics 2021-05-21 Kunle Adegoke

Powers of Fibonacci polynomials are expressed as single sums, improving on a double sum recently seen in the literature.

Number Theory · Mathematics 2021-07-29 Helmut Prodinger

We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.

Combinatorics · Mathematics 2022-08-03 Harold R. Parks , Dean C. Wills

Recent results about sums of cubes of Fibonacci numbers [Frontczak, 2018] are extended to arbitrary powers.

Number Theory · Mathematics 2019-07-19 Helmut Prodinger

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:…

General Mathematics · Mathematics 2024-11-20 Eteri Samsonadze

The balancing numbers $B_n$ ($n=0,1,\cdots$) are solutions of the binary recurrence $B_n=6B_{n-1}-B_{n-2}$ ($n\ge 2$) with $B_0=0$ and $B_1=1$. In this paper we show several relations about the sums of product of two balancing numbers of…

Number Theory · Mathematics 2021-07-19 Takao Komatsu , Gopal Krishna Panda

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…

General Mathematics · Mathematics 2022-03-29 Alessandro Mariani

It is demonstrated how an explicit expression of the (partial) sum of Tetranacci numbers can be found and proved using generating functions and the Hadamard product. We also provide a Binet-type formula for generalized Fibonacci numbers, by…

Number Theory · Mathematics 2020-01-22 Helmut Prodinger , Sarah J. Selkirk

In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…

History and Overview · Mathematics 2021-04-27 Lorenzo David

We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.

Number Theory · Mathematics 2017-10-16 Andrei K. Svinin , Svetlana V. Svinina

We offer several new summation identities involving harmonic numbers, odd harmonic numbers, and Fibonacci numbers. Our results are derived using three different approaches: partial summation, polynomial identities and binomial…

General Mathematics · Mathematics 2025-07-29 Kunle Adegoke , Segun Olofin Akerele , Robert Frontczak

In this paper, we provide a general framework for obtaining the formula for nested summation of powers of natural numbers. We define a special triangular array of numbers from which we can obtain the formula for nested summation of natural…

Number Theory · Mathematics 2019-06-27 Patibandla Chanakya , Putla Harsha

Summation by parts is used to find the sum of a finite series of generalized harmonic numbers involving a specific polynomial or rational function. The Euler-Maclaurin formula for sums of powers is used to find the sums of some finite…

Number Theory · Mathematics 2012-02-10 Maarten Kronenburg

Permutations can be represented as linear combinations of natural numbers with different powers. In this paper, its coefficient matrix and inverse matrix is derived, and the results show the coefficient matrix is a lower triangular matrix…

General Mathematics · Mathematics 2018-05-30 Yuyang Zhu

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

Classical Analysis and ODEs · Mathematics 2007-05-23 Peng Gao

Let $(F_n)_{n\ge 1}$ be the Fibonacci sequence. Define $P(F_n): = (\sum_{i=1}^n F_i)_{n\ge 1}$; that is, the function $P$ gives the sequence of partial sums of $(F_n)$. In this paper, we first give an identity involving $P^k(F_n)$, which is…

Combinatorics · Mathematics 2021-06-08 Hung Viet Chu

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,…

History and Overview · Mathematics 2019-01-15 Jacques Gélinas

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…

Number Theory · Mathematics 2018-06-20 Svinin Andrei K

Power series in which the summand satisfies a linear recurrence relation with polynomial coefficients are shown to be the solution of a linear differential or algebraic equation. Solving the associated differential or algebraic equation…

General Mathematics · Mathematics 2026-01-19 Erik Talvila
‹ Prev 1 2 3 10 Next ›