Let a1, a2, ... be the sequence defined recursively by a1 = 2, an = 3n-1 + an-1 if n ≥ 2. Use induction to show that an = 3 n + 1 2 for all n ≥ 1?