English
Related papers

Related papers: Summing Formulas For Generalized Tribonacci Number…

200 papers

We present an elementary proof of the generalization of the $k$-bonacci Binet formula, a closed form calculation of the $k$-bonacci numbers using the roots of the characteristic polynomial of the $k$-bonacci recursion.

Number Theory · Mathematics 2024-08-20 Harold R. Parks , Dean C. Wills

In this note, we propose simple summations for primes, which involve two finite nested sums and Bernoulli numbers. The summations can also be expressed in terms of Bernoulli polynomials.

History and Overview · Mathematics 2023-03-20 Jean-Christophe Pain

In this paper, we introduce relations between binomial sums involving (generalized) Fibonacci and Lucas numbers, and different kinds of binomial coefficients. We also present some relations between sums with two and three binomial…

Combinatorics · Mathematics 2023-10-06 Kunle Adegoke , Robert Frontczak , Taras Goy

We present a closed-form solution for n-th term of a general three-term recurrence relation with arbitrary given n-dependent coefficients. The derivation and corresponding proof are based on two approaches, which we develop and describe in…

Classical Analysis and ODEs · Mathematics 2013-11-20 Ivan Gonoskov

We present a natural, combinatorial problem whose solution is given by the meta-Fibonacci recurrence relation $a(n) = \sum_{i=1}^p a(n-i+1 - a(n-i))$, where $p$ is prime. This combinatorial problem is less general than those given in [3]…

Combinatorics · Mathematics 2019-02-11 Ramin Naimi , Eric Sundberg

In a recent paper, Bilu et al. studied a conjecture of Marques and Lengyel on the $p$-adic valuation of the Tribonacci sequence. In this article, we study the $p$-adic valuation of third order linear recurrence sequences by considering a…

Number Theory · Mathematics 2024-10-17 Deepa Antony , Rupam Barman

We propose investigating a summation analog of the paradigm for parallel integration. We make some first steps towards an indefinite summation method applicable to summands that rationally depend on the summation index and a P-recursive…

Combinatorics · Mathematics 2024-06-10 Shaoshi Chen , Ruyong Feng , Manuel Kauers , Xiuyun Li

We give an overview of classical summation formulations, such as Poisson's and Voronoi's, and then turn to modern versions involving modular form coefficients. A new formula involving the coefficients of cusp forms on GL(3) is described,…

Number Theory · Mathematics 2007-05-23 Stephen D. Miller , Wilfried Schmid

We prove new exact formulas for the generalized sum-of-divisors functions, $\sigma_{\alpha}(x) := \sum_{d|x} d^{\alpha}$. The formulas for $\sigma_{\alpha}(x)$ when $\alpha \in \mathbb{C}$ is fixed and $x \geq 1$ involves a finite sum over…

Number Theory · Mathematics 2019-04-23 Maxie D. Schmidt

Explicit determinations of several classes of trigonometric sums are given. These sums can be viewed as analogues or generalizations of Gauss sums. In a previous paper, two of the present authors considered primarily sine sums associated…

Number Theory · Mathematics 2007-05-23 Matthias Beck , Bruce C. Berndt , O-Yeat Chan , Alexandru Zaharescu

We define generalized bivariate polynomials, from which upon specification of initial conditions the bivariate Fibonacci and Lucas polynomials are obtained. Using essentially a matrix approach we derive identities and inequalities that in…

Combinatorics · Mathematics 2007-05-23 Mario Catalani

We obtain explicit factored closed-form expressions for Fibonacci and Lucas sums of the form \mbox{$\sum_{k = 1}^n {F_{2rk}^3 }$} and \mbox{$\sum_{k = 1}^n {L_{2rk}^3 }$}, where $r$~and~$n$ are integers.

Number Theory · Mathematics 2017-06-29 Kunle Adegoke

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

General Mathematics · Mathematics 2026-02-25 Passimzouwé Dagou , Pagdame Tiebekabe , Kouèssi Norbert Adédji , Kokou Tchariè

In this paper we give efficient algorithms for computing second-, third-, and fourth-order linear recurrences. We also present an algorithm scheme for computing terms with the indices $N,\ldots,N+n-1$ of an $n$th-order linear recurrence.…

Number Theory · Mathematics 2018-04-25 Dmitry I. Khomovsky

We study growth rates of generalised Fibonacci sequences of a particular structure. These sequences are constructed from choosing two real numbers for the first two terms and always having the next term be either the sum or the difference…

Number Theory · Mathematics 2021-02-22 Kevin Hare , J. C. Saunders

In this paper we investigate congruence relationships of particular finite generalized harmonic numbers sums. We suggest more transparent and simpler method to analyse these sums and present several additional results for certain special…

Number Theory · Mathematics 2020-12-01 Aidas Medžiūnas

In this paper we study how to accelerate the convergence of the ratios (x_n) of generalized Fibonacci sequences. In particular, we provide recurrent formulas in order to generate subsequences (x_{g_n}) for every linear recurrent sequence…

Number Theory · Mathematics 2013-01-16 Marco Abrate , Stefano Barbero , Umberto Cerruti , Nadir Murru

We give some results and conjectures about recurrence relations for certain sequences of binomial sums.

Combinatorics · Mathematics 2007-05-23 Johann Cigler

In this paper, closed formulas for the eigenvectors of a particular class of matrices generated by generalized permutation matrices, named generalized circulant matrices, are presented.

Spectral Theory · Mathematics 2023-06-14 Enide Andrade , Dante Carrasco-Olivera , Cristina Manzaneda

Direct links between generalized harmonic numbers, linear Euler sums and Tornheim double series are established in a more perspicuous manner than is found in existing literature. We show that every linear Euler sum can be decomposed into a…

Number Theory · Mathematics 2016-03-15 Kunle Adegoke