Fibonacci Sequence: a1 = 1, a2 = 1, an = an-1 + an-2, for n≥3. In other words, the nth term (for n≥3) is the sum of the two preceding terms).
So, the first few terms are 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...
Binet's Formula: an = [(1+√5)n - (1-√5)n] / [2n√5]
So, a4 = [(1+√5)4 - (1-√5)4] / (16√5)
= { [(1+√5)2]2 - [(1-√5)2]2 } / (16√5)
= [(6+2√5)2 - (6-2√5)2] / (16√5)
= [36 + 24√5 + 20 - (36 - 24√5 + 20)] / (16√5)
= 48√5/(16√5) = 3