Related papers: Generalized Cullen Numbers in Linear Recurrence Se…
We derive the double recurrence $e_n = \frac{1}{2}(a_{n-1}+5b_{n-1}); f_{n} = \frac{1}{2}(a_{n-1}+b_{n-1})$ with $e_0=2;f_0=0$ for the Fibonacci numbers, leading to an extremely simple and fast implementation. Though the recurrence is…
For $m=3,4,\ldots$ those $p_m(x)=(m-2)x(x-1)/2+x$ with $x\in\mathbb Z$ are called generalized $m$-gonal numbers. Sun [13] studied for what values of positive integers $a,b,c$ the sum $ap_5+bp_5+cp_5$ is universal over $\mathbb Z$ (i.e., any…
Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…
One of the best known and oldest identities for the Fibonacci sequence $F_n$ is $F_{n+1}F_{n-1}-F_{n}^2=(-1)^n$ which was derived first by R. Simson in 1753 and it is now called as Simson or Cassini Identity. In this paper, we generalize…
An integer of the form $P_m(x)= \frac{(m-2)x^2-(m-4)x}{2}$ for an integer $x$, is called a generalized $m$-gonal number. For positive integers $\alpha_1,\dots,\alpha_u$ and $\beta_1,\dots,\beta_v$, a mixed sum…
Given a linear recurrence of the form $c_n=a_1c_{n-1}+\cdots+a_j c_{n-j}$, it is well-known that $c_n=\sum_{r}p_r(n)r^n$, where the sum is taken over the set of characteristic roots and each $p_r(n)$ is some polynomial. We give a closed…
In this paper, we show that if $(U_n)_{n\ge 1}$ is any nondegenerate linearly recurrent sequence of integers whose general term is up to sign not a polynomial in $n$, then the inequality $\phi(|U_n|)\ge |U_{\phi(n)}|$ holds on a set of…
For any integer $k \geq 2$, let $\{Q_{n}^{(k)} \}_{n \geq -(k-2)}$ denote the $k$-generalized Pell-Lucas sequence which starts with $0, \dots ,2,2$($k$ terms) where each next term is the sum of the $k$ preceding terms. In this paper, we…
We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…
The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the new sequence S_{k,n} with initial conditions S_{k,0} = 2b and S_{k,1} = bk + a, which is generated by the…
Let $\beta$ be a non-unit real algebraic integer greater than one and $\{a_{n}\}_{n \geq 0}$ be a sequence satisfying a linear recurrence relation $a_{n+3}=aa_{n+2}+ba_{n+1}+ca_{n}$. Under certain conditions, we prove that the number of…
Fibonacci sequence, generated by summing the preceding two terms, is a classical sequence renowned for its elegant properties. In this paper, leveraging properties of generalized Fibonacci sequences and formulas for consecutive sums of…
Let (F_n)_{n} be the classical Fibonacci sequence. It is well-known that it satisfies F_{n}^2 + F_{n+1}^2 = F_{2n+1}. In this study, we explore generalizations of this Diophantine equation in several directions. First, we solve the…
The weighted Delannoy numbers are defined by the recurrence relation $f_{m,n}=\alpha f_{m-1,n}+ \beta f_{m,n-1}+ \gamma f_{m-1,n-1}$ if $m n>0 $, with $f_{m,n}=\alpha^m \beta^n$ if $n m=0$. In this work, we study a generalization of these…
We present numerous interesting, mostly new, results involving the $n$-step Fibonacci numbers and $n$-step Lucas numbers and a generalization. Properties considered include recurrence relations, summation identities, including binomial and…
A positive linear recurrence sequence (PLRS) is a sequence defined by a homogeneous linear recurrence relation with positive coefficients and a particular set of initial conditions. A sequence of positive integers is \emph{complete} if…
A beautiful theorem of Zeckendorf states that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}_{n=1}^{\infty}$. Lekkerkerker proved that the average number of summands for integers in $[F_n,…
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…
We show that if $k\ge 2$ is an integer and $(F_n^{(k)})_{n\ge 0}$ is the sequence of $k$-generalized Fibonacci numbers, then there are only finitely many triples of positive integers $1<a<b<c$ such that $ab+1,~ac+1,~bc+1$ are all members of…
We prove a linear recurrence relation for a large family of generalized Schreier sets, which generalizes the Fibonacci recurrence proved by Bird and higher order Fibonacci recurrence proved by the second author et al. Furthermore, we show a…