On Prime Divisors of the Terms of Second Order Linear Recurrence Sequences

1990 ◽  
pp. 203-207 ◽  
Author(s):  
Peter Kiss
Keyword(s):  
Second Order ◽  
Linear Recurrence ◽  
Prime Divisors ◽  
Order Linear ◽  
Recurrence Sequences

scholarly journals Decomposable polynomials in second order linear recurrence sequences

2018 ◽  
Vol 159 (3-4) ◽  
pp. 321-346 ◽  
Author(s):  
Clemens Fuchs ◽  
Christina Karolus ◽  
Dijana Kreso
Keyword(s):  
Second Order ◽  
Linear Recurrence ◽  
Order Linear ◽  
Recurrence Sequences

scholarly journals General Linear Recurrence Sequences and Their Convolution Formulas

Axioms ◽  
2019 ◽  
Vol 8 (4) ◽  
pp. 132 ◽  
Author(s):  
Paolo Emilio Ricci ◽  
Pierpaolo Natalini
Keyword(s):  
Generating Functions ◽  
Recurrence Relations ◽  
Second Order ◽  
General Linear ◽  
Linear Recurrence ◽  
Order Linear ◽  
Matrix Polynomials ◽  
Recurrence Sequences ◽  
Straightforward Extension

We extend a technique recently introduced by Chen Zhuoyu and Qi Lan in order to find convolution formulas for second order linear recurrence polynomials generated by 1 1 + a t + b t 2 x . The case of generating functions containing parameters, even in the numerator is considered. Convolution formulas and general recurrence relations are derived. Many illustrative examples and a straightforward extension to the case of matrix polynomials are shown.

scholarly journals Distribution of some quadratic linear recurrence sequences modulo 1

2014 ◽  
Vol 30 (1) ◽  
pp. 79-86
Author(s):  
ARTURAS DUBICKAS ◽  
Keyword(s):  
Limit Point ◽  
Fibonacci Sequence ◽  
Second Order ◽  
Linear Recurrence ◽  
Order Linear ◽  
Recurrence Sequences

We show that if a is an even integer then for every ξ ∈ R the smallest limit point of the sequence ||ξan||∞n=1 does not exceed |a|/(2|a| + 2) and this bound is best possible in the sense that for some ξ this constant cannot be improved. Similar (best possible) bound is also obtained for the smallest limit point of the sequence ||ξxn||∞n=1, where (xn)∞n=1 satisfies the second order linear recurrence xn = axn−1 + bxn−2 with a, b ∈ N satisfying a > b. For the Fibonacci sequence (Fn)∞n=1 our result implies that supξ∈R lim infn→∞ ||ξFn|| = 1/5, and e.g., in case when a > 3 is an odd integer, b = 1 and θ := a/2 + p a 2/4 + 1 it shows that supξ∈R lim infn→∞ ||ξθn|| = (a − 1)/2a.

scholarly journals Some New Identities of Second Order Linear Recurrence Sequences

Symmetry ◽  
2019 ◽  
Vol 11 (12) ◽  
pp. 1496 ◽  
Author(s):  
Yanyan Liu ◽  
Xingxing Lv
Keyword(s):  
Power Series ◽  
Second Order ◽  
Linear Recurrence ◽  
Combinatorial Method ◽  
Order Linear ◽  
Computational Problem ◽  
Characteristic Roots ◽  
Recursive Sequence ◽  
Recurrence Sequences

The main purpose of this paper is using the combinatorial method, the properties of the power series and characteristic roots to study the computational problem of the symmetric sums of a certain second-order linear recurrence sequences, and obtain some new and interesting identities. These results not only improve on some of the existing results, but are also simpler and more beautiful. Of course, these identities profoundly reveal the regularity of the second-order linear recursive sequence, which can greatly facilitate the calculation of the symmetric sums of the sequences in practice.

scholarly journals Horadam Sequences and Tridiagonal Determinants

Symmetry ◽  
2020 ◽  
Vol 12 (12) ◽  
pp. 1968
Author(s):  
Kwang-Wu Chen
Keyword(s):  
Second Order ◽  
Tridiagonal Matrix ◽  
Linear Recurrence ◽  
Order Linear ◽  
Tridiagonal Matrices ◽  
Recurrence Sequences

We consider a family of particular tridiagonal matrix determinants which can represent the general second-order linear recurrence sequences. These determinants can be changed to symmetric or skew-symmetric tridiagonal determinants. To evaluate the complex factorizations of any Horadam sequence, we evaluate the eigenvalues of some special tridiagonal matrices and their corresponding eigenvectors. We also use these determinant representations to obtain some formulas in these sequences.

scholarly journals Mersenne-Horadam identities using generating functions

2020 ◽  
Vol 12 (1) ◽  
pp. 34-45
Author(s):  
R. Frontczak ◽  
T. Goy
Keyword(s):  
Generating Functions ◽  
Second Order ◽  
Linear Recurrence ◽  
Order Linear ◽  
Balancing Numbers ◽  
Mersenne Numbers

The main object of the present paper is to reveal connections between Mersenne numbers $M_n=2^n-1$ and generalized Fibonacci (i.e., Horadam) numbers $w_n$ defined by a second order linear recurrence $w_n=pw_{n-1}+qw_{n-2}$, $n\geq 2$, with $w_0=a$ and $w_1=b$, where $a$, $b$, $p>0$ and $q\ne0$ are integers. This is achieved by relating the respective (ordinary and exponential) generating functions to each other. Several explicit examples involving Fibonacci, Lucas, Pell, Jacobsthal and balancing numbers are stated to highlight the results.

Sign in / Sign up

Export Citation Format

Share Document