The sequence #0, 2, 8, 30, 112, 418,...# is defined recursively by #a_0 = 0#, #a_1 = 2#, #a_(n+1) = 4a_n-a_(n-1)#. What is the formula for a general term #a_n#?
1 Answer
Explanation:
Proof by induction
Case
#((2+sqrt(3))^0 - (2-sqrt(3))^0)/sqrt(3) = (1 - 1) / sqrt(3) = 0 = a_0#
Case
#((2+sqrt(3))^1 - (2-sqrt(3))^1)/sqrt(3) = (2sqrt(3))/(sqrt(3)) = 2 = a_1#
Induction step
Note that
So:
#((2+sqrt(3))^(n+1)-(2-sqrt(3))^(n+1))/sqrt(3)#
#=((2+sqrt(3))(2+sqrt(3))^n-(2-sqrt(3))(2-sqrt(3))^n)/sqrt(3)#
#=(4((2+sqrt(3))^n-(2-sqrt(3))^n)-((2-sqrt(3))(2+sqrt(3))^n-(2+sqrt(3))(2-sqrt(3))^n))/sqrt(3)#
#=(4((2+sqrt(3))^n-(2-sqrt(3))^n))/sqrt(3)-((2+sqrt(3))^(n-1)-(2-sqrt(3))^(n-1))/sqrt(3)#
#=4a_n-a_(n-1)#
Bonus
Note that
So:
#3a_n^2+4 = 3(((2+sqrt(3))^n - (2-sqrt(3))^n)/sqrt(3))^2 + 4#
#color(white)(3a_n^2+4) = ((2+sqrt(3))^n - (2-sqrt(3))^n)^2 + 4#
#color(white)(3a_n^2+4) = (2+sqrt(3))^(2n) - 2(2+sqrt(3))^n(2-sqrt(3))^n+(2-sqrt(3))^(2n) + 4#
#color(white)(3a_n^2+4) = (2+sqrt(3))^(2n) + 2(2+sqrt(3))^n(2-sqrt(3))^n+(2-sqrt(3))^(2n)#
#color(white)(3a_n^2+4) = ((2+sqrt(3))^n + (2-sqrt(3))^n)^2#
Note that