A certain computer program generates a sequence of numbers a1, a2, … , a n such that a1 = a2 = 1 and ak = ak-1 + 2ak-2 for all integers k such that 3 ≤ k ≤ n. If n > 6, then a7 = ?

A. 32
B. 43
C. 64
D. 100
E. 128

OA: B

This seems harder than the GMAT prep problem.