Sequência Lucas L_n
- Created by
- Renato Passos, Eng. de Software
- Reviewed by
- Renato Passos, Eng. de Software
Last updated: Apr 18, 2026
About this calculator
The Lucas sequence calculator L_n computes the nth term using the recursive formula L₀ = 2, L₁ = 1, and Lₙ = Lₙ₋₁ + Lₙ₋₂ for n ≥ 2. This sequence is similar to Fibonacci but with distinct initial values. It is applied in number theory, combinatorics, and pattern analysis. Enter the desired n value to obtain the corresponding term.
The Lucas sequence follows a recursive relationship where each term depends on the two previous ones. For example, L₂ = L₁ + L₀ = 1 + 2 = 3. This exponential growth is useful in computational algorithms and optimization. The calculator iteratively applies the formula to reach the requested term, ensuring accuracy even for large n values.
Use this tool in mathematical studies, programming, or solving recursive sequence problems. Common in algebra and technical fields, it also applies to pattern analysis in biology or economics. Avoid negative or non-integer inputs since the sequence is defined only for positive integers.
Important considerations: high n values may require longer processing due to recursion. For n > 100,000, use Binet's closed-form formula or mathematical approximations. Always validate inputs as positive integers to prevent invalid results.
Frequently asked questions
What is the first term of the Lucas sequence?
The first term (L₀) of the Lucas sequence is 2, followed by L₁ = 1. The sequence continues with L₂ = 3, L₃ = 4, etc., following the rule Lₙ = Lₙ₋₁ + Lₙ₋₂.
How does the Lucas sequence differ from the Fibonacci sequence?
While Fibonacci starts with F₀ = 0 and F₁ = 1, the Lucas sequence begins with L₀ = 2 and L₁ = 1. Both use the same recurrence relation but produce distinct values from the second term onward.
Is there a direct formula to calculate Lₙ without iterations?
Yes, Binet's formula for Lucas is Lₙ = φⁿ + ψⁿ, where φ = (1 + √5)/2 and ψ = (1 - √5)/2. This formula calculates terms directly without iteration.
What practical applications do sequences like Lucas have?
Recursive sequences like Lucas are used in cryptography, algorithm analysis, number theory, and studying natural patterns such as plant phyllotaxis.
Can I calculate negative terms in the Lucas sequence?
No, the Lucas sequence is defined only for non-negative integers (n ≥ 0). Negative values produce mathematically inconsistent results.