Related papers: Linear recurrence sequences with indices in arithm…
In this paper we extend the notion of Melham sum to the Pell and Pell-Lucas sequences. While the proofs of general statements rely on the binomial theorem, we prove some spacial cases by the known Pell identities. We also give extensions of…
In this work, we introduce a symmetric algorithm obtained by the recurrence relation a_{n}^{k}=a_{n-1}^{k}+a_{n}^{k-1}. We point out that this algorithm can be apply to hyperharmonic-, ordinary and incomplete Fibonacci- and Lucas numbers.…
Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…
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…
This article demonstrates, using numerous examples of varying complexity, how one can visually prove summation formulas involving binomial coefficients by exclusively using the recurrence relation for binomial coefficients and its…
Six families of generalized hypergeometric series in a variable $x$ and an arbitrary number of parameters are considered. Each of them is indexed by an integer $n$. Linear recurrence relations in $n$ relate these functions and their product…
We consider series expansions in bases of classical orthogonal polynomials. When such a series solves a linear differential equation with polynomial coefficients, its coefficients satisfy a linear recurrence equation. We interpret this…
Hypergeometric sequences obey first-order linear recurrence relations with polynomial coefficients and are commonplace throughout the mathematical and computational sciences. For certain classes of hypergeometric sequences, we prove linear…
We consider a class of lattice paths with certain restrictions on their ascents and down steps and use them as building blocks to construct various families of Dyck paths. We let every building block $P_j$ take on $c_j$ colors and count all…
A recurrence relation is said to have the Laurent property if all of its iterates are Laurent polynomials in the initial values with integer coefficients. We consider a family of nonlinear recurrences with the Laurent property, which were…
We generalize the solution of linear recurrence relations from fields to central division algebras, adapting the standard tools of companion matrices and characteristic polynomials to the non-commutative setting. We then solve linear…
In this paper, we give recurrence relations and identities for some integer sequences related to Ward numbers such as Ward-Lah numbers, varied Ward numbers and binomial Ward numbers. Most of the sequences are entered in the On-Line…
A three term recurrence relation is derived for a basis consisting of polynomials multiplied by sines and cosines with large, but fixed frequencies. A numerical method for computing the coefficients of the three term recurrence relation is…
In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond…
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…
Associated to a finite measure on the real line with finite moments are recurrence coefficients in a three-term formula for orthogonal polynomials with respect to this measure. These recurrence coefficients are frequently inputs to modern…
Finding integer solutions to norm form equations is a classical Diophantine problem. Using the units of the associated coefficient ring, we can produce sequences of solutions to these equations. It is known that these solutions can be…
We investigate general properties of number sequences which allow explicit representation in terms of products. We find that such sequences form whole families of number sequences sharing similar recursive identities. Restricting to the…
In their study of a binomial sum related to Wolstenholme's theorem, Chamberland and Dilcher prove that the corresponding sequence modulo primes $p$ satisfies congruences that are analogous to Lucas' theorem for the binomial coefficients…
Polynomial ensembles are determinantal point processes associated with (non necessarily orthogonal) projections onto polynomial subspaces. The aim of this survey article is to put forward the use of recurrence coefficients to obtain the…