Lucas Sequences: Structure, Properties & Applications

• Lucas sequences are families of second-order linear recurrences defined by two integer parameters, generalizing classical sequences like Fibonacci and Pell.
• They exhibit rich arithmetic properties including primitive divisors, periodicity under modular arithmetic, and deep connections to quadratic fields and modular forms.
• Their applications span combinatorial interpretations, graph-theoretic models, and dynamical systems, offering practical insights into algebra and number theory.

Lucas sequences are a family of second-order linear recurrences defined over the integers, generalizing prominent integer sequences such as the Fibonacci, Pell, Mersenne, and Lucas numbers themselves. These sequences arise naturally in algebraic, arithmetic, combinatorial, and dynamical settings, with deep structural properties relating them to the arithmetic of quadratic fields, primitive divisors, modular forms, graph theory, elliptic recurrences, and more.

1. Definition and Structure

A Lucas sequence is specified by two integer parameters, typically denoted $P$ and $Q$, with the characteristic polynomial

$x^2 - P x + Q = 0,$

whose discriminant $D = P^2 - 4Q$ is assumed nonzero to ensure non-degeneracy. The canonical sequences are:

• Lucas sequence of the first kind ($U_n(P, Q)$):

$$U_0 = 0,\quad U_1 = 1,\quad U_{n} = P\,U_{n-1} - Q\,U_{n-2} \quad (n \geq 2).$$

• Lucas sequence of the second kind ($V_n(P, Q)$):

$$V_0 = 2, \quad V_1 = P, \quad V_n = P\,V_{n-1} - Q\,V_{n-2} \quad (n \geq 2).$$

Via the roots $\alpha, \beta$ of the characteristic polynomial,

$$\alpha = \frac{P + \sqrt{D}}{2},\qquad \beta = \frac{P - \sqrt{D}}{2},$$

the Binet-type closed forms are: $$U_n(P, Q) = \frac{\alpha^n - \beta^n}{\alpha - \beta}, \qquad V_n(P, Q) = \alpha^n + \beta^n.$$ Non-degeneracy usually further requires that $\alpha / \beta$ is not a root of unity.

Special Cases

Name	Parameters (P,Q)	Sequence
Fibonacci	(1, –1)	0, 1, 1, 2, 3, 5, …
Lucas	(1, –1)	2, 1, 3, 4, 7, 11, … (V-sequence)
Pell	(2, –1)	0, 1, 2, 5, 12, 29, …
Mersenne	(3, 2)	0, 1, 3, 7, 17, 41, …
Jacobsthal	(1, –2)	0, 1, 1, 3, 5, 11, …

These sequences encode diverse number-theoretic and combinatorial phenomena (Alekseyev, 2010, Bennett et al., 2018).

2. Arithmetic Theory: Primitive Divisors and Perfect Powers

The divisibility structure of Lucas sequences is central. A primitive prime divisor of $U_n$ is a prime dividing $U_n$ but not any earlier $U_k (1 \leq k < n)$.

• Zsigmondy’s and Carmichael’s theorems: For non-degenerate, regular Lucas sequences ($\gcd(P, Q) = 1$), all terms $U_n$ with $n > 30$ have primitive divisors, with a complete classification of exceptional cases for $2 \leq n \leq 30$ (Conceição, 2024).
• Prime power terms: The question of when $U_n = y^p$ (with p prime) can hold leads to a deep connection with Galois representations and modular forms. For many parameter choices, nontrivial perfect powers are excluded except for small $n$; under the Frey–Mazur conjecture explicit upper bounds for such $p$ are obtained, with unconditional results for specific parameters (Silliman et al., 2013).

3. Congruence, Periodicity, and Modular Structure

The modular arithmetic of Lucas sequences is tightly governed by their characteristic parameters.

• Periodicity: For a modulus $m$, the sequence $U_n(P, Q) \bmod m$ is periodic of some minimal period $\pi_U(m)$. The entry point $e_U(m)$ is the index of the first zero mod $m$, and their quotient defines an order parameter $\omega_U(m) = \pi_U(m)/e_U(m)$. Explicit formulas and relationships among these quantities are established, including comprehensive dichotomies for $Q = \pm1$ (Fiebig et al., 2024).
• Cyclotomic and $p$-adic properties: Möbius inversion and cyclotomic factorization allow the derivation of sharp $p$-adic congruences for Lucas sequences, generalizing and refining results of Carmichael (Ross et al., 3 Dec 2025). For instance, congruences of the type

$U_{p^k n}/U_{p^{k-1} n} \equiv (D/p) \pmod{p^k}$

hold under precise conditions, constraining the structure of divisors and entry points.

• Chebyshev-like bias: Empirical data show a bias in the distribution of primes dividing $U_n$ according to the value of $(D/p)$, analogous to classical prime number races (Ross et al., 3 Dec 2025).

4. Combinatorics, Graph Theory, and Polynomial Generalizations

Lucas sequences have extensive combinatorial and graph-theoretic realizations.

• The number of independent sets in path graphs $P_n$ is $F_{n+2}$, and in cycle graphs $C_n$ is $L_n$. More general classes (chainsaw and broken chainsaw graphs) encode $U_{n+2}(a,-b)$ and $V_n(a, -b)$, providing combinatorial interpretations for both Lucas sequences and Dickson polynomials (Alexander et al., 2014).
• Lucas polynomials, with recurrence $\{n\} = s \{n-1\} + t \{n-2\}$, and their analogues for binomial and Catalan numbers, admit uniform lattice path models. These models reveal that by replacing each factor $m$ by $\{m\}$, factorial and binomial constructs generalize with positivity and combinatorial interpretations preserved (Bennett et al., 2018).

5. Density, Representation Problems, and Intersections

Lucas sequences and their variants characterize substantial and precisely quantifiable subsets of the integers.

• Representation bounds: For fixed $n$, the number of distinct integers $x \leq N$ that arise as $U_n(A, B)$ for some non-degenerate Lucas pair grows like $\asymp N^{n-1}$ for odd $n \geq 7$, with sharp upper and lower bounds (Hajdu et al., 2024).
• Intersection theory: The intersection of two Lucas sequences $U_n(P_1, Q_1), U_n(P_2, Q_2)$ is finite, except in a handful of precisely classified exceptional cases, and can be addressed effectively via the solution of quadratic Diophantine and Thue equations (Alekseyev, 2010).
• Partition uniqueness: In the style of Zeckendorf’s theorem, every integer admits a sum representation as non-consecutive Lucas numbers, with at most two such representations—establishing a nuanced non-uniqueness rate and explicit density for doubly-representable integers (Chu et al., 2020).

6. Log-Concavity, Dynamical Extensions, and Advanced Generalizations

• Log-concavity: The sequence $U_n(P, Q)$ is infinite log-concave if and only if (in the distinct-root case) $Q > 0$ and $P > 2 \sqrt{Q}$ or $P < -2\sqrt{Q}$; Fibonacci numbers do not even satisfy 1-fold log-concavity, while Mersenne numbers are infinitely log-concave (Giacomelli, 2011).
• Dynamical and elliptic generalizations: Lucas sequences extend to discrete-time (level-dependent) dynamical systems, commutative and non-commutative settings, and elliptic recurrences. Solutions in the elliptic case involve ratios of products of Jacobi theta functions, and non-commutative analogues satisfy elliptic versions of the Cassini identity (Schlosser et al., 2020).
• Monoid structure and factor statistics: The multiplicative monoid generated by the positive terms with primitive divisors in a Lucas sequence admits unique factorization and Erdős–Kac-type theorems, but with the non-Gaussian distribution for the total number of factors, reflecting subtler combinatorial structure than in the ordinary integers (Heuberger et al., 2016).

7. Open Problems and Future Directions

While the arithmetic and combinatorics of Lucas sequences are broadly understood, several explicit problems remain:

• Classification of log-concavity for higher-order linear recurrences is open (Giacomelli, 2011).
• A full list of exceptional triples $(P, Q, n)$ without primitive divisors in polynomial rings for generalized Lehmer or doubly-indexed sequences remains incomplete (Conceição, 2024).
• Density and distribution questions for intersections and perfect powers continue to rely on deep conjectures in the arithmetic of elliptic curves and modularity (Silliman et al., 2013).
• The dynamical systems viewpoint and elliptic generalizations suggest unexplored links to complex dynamics and theta function identities (Tapia, 2018, Schlosser et al., 2020).

Lucas sequences thus stand at the intersection of arithmetic, combinatorics, algebra, and dynamics, serving as a rich prototype for the study of linear recurrences and their vast structural, analytic, and algebraic properties.