1. Home
2. Standards
3. For example: The Fibonacci sequence is defined recursively by 𝑓(0) = 𝑓(1) = 1, 𝑓(𝑛 + 1) = 𝑓(𝑛) + (𝑛 − 1) for 𝑛 ≥ 1.

For example: The Fibonacci sequence is defined recursively by 𝑓(0) = 𝑓(1) = 1, 𝑓(𝑛 + 1) = 𝑓(𝑛) + (𝑛 − 1) for 𝑛 ≥ 1.