Module 5
Recurrence Relations
Compute and visualize classic recurrence sequences — Fibonacci, Lucas, geometric, factorial, and custom linear recurrences.
Sequence Presets
Choose a classic recurrence or define your own
Fibonacci
Each term is the sum of the two preceding terms.
F(n) = F(n-1) + F(n-2)First 15 Terms
n=00
n=11
n=21
n=32
n=43
n=55
n=68
n=713
n=821
n=934
n=1055
n=1189
n=12144
n=13233
n=14377