Recursive Sequence Generator
aₙ = p·aₙ₋₁ + q·aₙ₋₂
a₀ (first term)
a₁ (second term)
p (multiplier for aₙ₋₁)
q (multiplier for aₙ₋₂)
Terms to generate (≤30)
✓Sequence
1.00, 1.00, 2.00, 3.00, 5.00, 8.00, 13.00, 21.00, 34.00, 55.00
Last term
55.0000
Sum
143.0000
A recursive sequence defines each term using previous terms. The Fibonacci sequence is the most famous example (each term is the sum of the two before it). Many real-world processes follow recursive patterns.
References
🔒
100% Gratuit
Fără înregistrare
✓
Precis
Formule verificate
⚡
Instant
Rezultate în timp ce tastezi
📱
Mobile Ready
Toate dispozitivele