Related papers: A Study of Second-Order Linear Recurrence Sequence…
In this article, we introduce and study a new integer sequence referred to as the higher order Mersenne sequence. The proposed sequence is analogous to the higher order Fibonacci numbers and closely associated with the Mersenne numbers.…
Let $A$ and $B$ be complex numbers, and let $(w_n)_{n\ge0}$ be a sequence of complex numbers with $w_{n+1}=Aw_n-Bw_{n-1}$ for all $n=1,2,3,\ldots$. When $w_0=0$ and $w_1=1$, the sequence $(w_n)_{n\ge0}$ is just the Lucas sequence…
In this work, we define a more general family of polynomials in several variables satisfying a linear recurrence relation. Then we provide explicit formulas and determinantal expressions. Finally, we apply these results to recurrent…
The aim of this work is to consider the bicomplex third-order Jacobsthal quaternions and to present some properties involving this sequence, including the Binet-style formulae and the generating functions. Furthermore, Cassini's identity…
Number sequences defined by a linear recursion relation are studied by means of generating functions. Indices of the terms in the recursion relation have arbitrary differenses. In addition to formulas for the nth term an algorithm is…
By investigating a recurrence relation about functions, we first give alternative proofs of various identities on Fibonacci numbers and Lucas numbers, and then, make certain well known identities visible via certain trivalent graph…
In this article we provide with combinatorial proofs of some recent identities due to Sury and McLaughlin. We show that, the solution of a general linear recurrence with constant coefficients can be interpreted as a determinant of a matrix.…
We introduce the degenerate Bernoulli numbers of the second kind as a degenerate version of the Bernoulli numbers of the second kind. We derive a family of nonlinear differential equations satisfied by a function closely related to the…
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.…
This paper is the continuation of \cite{htl}, where we deal with Lucas sequences. Here we study integers represented by integer sequences which satisfy binary recursive relations. In case of non-degenerate sequences we give bounds for the…
Consider a sequence of real-valued functions of a real variable given by a homogeneous linear recursion with differentiable coefficients. We show that if the functions in the sequence are differentiable, then the sequence of derivatives…
Let $(a_n)_{n=0}^\infty$ be a second-order linear recurrence sequence with constant coefficients over the field of $p$-adic numbers $\mathbb{Q}_p$. We study the set of limit points of the sequence of consecutive ratios…
The objective of this manuscript is to offer explicit expressions for diverse categories of infinite series incorporating the Fibonacci (Lucas) sequence and the Riemann zeta function. In demonstrating our findings, we will utilize…
We develop a toolbox for the error analysis of linear recurrences with constant or polynomial coefficients, based on generating series, Cauchy's method of majorants, and simple results from analytic combinatorics. We illustrate the power of…
In this paper, by presenting bi-periodic Lucas numbers as a binomial sum, we introduce the bi-periodic incomplete Lucas numbers. After that, by using the bi-periodic incomplete Lucas numbers, we derive the recurrence relation and the…
We define impulse response sequence in the set of all linear recurring sequences satisfying a linear recurrence relation of order $r$. The generating function and expression of the impulse response sequence are presented. Some identities of…
A second order polynomial sequence is of \emph{Fibonacci-type} (\emph{Lucas-type}) if its Binet formula has a structure similar to that for Fibonacci (Lucas) numbers. Known examples of these type of sequences are: Fibonacci polynomials,…
This paper presents new identities expressing the terms of Fibonacci, Lucas, and generalized Fibonacci sequences with multiple indices through powers of Lucas numbers and binomial coefficients. The obtained formulas rely on the application…
By means of the generating function method, a linear recurrence relation is explicitly resolved. The solution is expressed in terms of the Stirling numbers of both the first and the second kind. Two remarkable pairs of combinatorial…
We study properties of functions of binomial coefficients mod 2 and derive a set of recurrence relations for sums of products of binomial coefficients mod 2. We show that they result in sequences that are the run length transforms of well…