Fibonacci Number B3102D
1. **Problem Statement:** Find the 7th Fibonacci number using the Fibonacci sequence formula.
2. **Formula:** The Fibonacci sequence is defined by the recurrence relation:
$$F_n = F_{n-1} + F_{n-2}$$
with initial conditions:
$$F_0 = 0, \quad F_1 = 1$$
3. **Explanation:** Each term is the sum of the two preceding terms. This sequence starts as 0, 1, 1, 2, 3, 5, 8, ...
4. **Calculation:** Calculate terms up to $F_7$:
- $F_2 = F_1 + F_0 = 1 + 0 = 1$
- $F_3 = F_2 + F_1 = 1 + 1 = 2$
- $F_4 = F_3 + F_2 = 2 + 1 = 3$
- $F_5 = F_4 + F_3 = 3 + 2 = 5$
- $F_6 = F_5 + F_4 = 5 + 3 = 8$
- $F_7 = F_6 + F_5 = 8 + 5 = 13$
5. **Answer:** The 7th Fibonacci number is **13**.