The Lucas numbers L(n) have almost the same definition as the Fibonacci numbers: if n 1 if n -2 L(n) 3 L(n-1) + L(n-2) if n > 2. nition of L(n) differentf O Subtractio O The base cases are different. O More than 2 previous terms are required in the calculation of a new term. O only one previous term is required for the calculation of a new term . O The odd terms are different. n is involved