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.
Patterns / Sequences
This topic has expert replies
- PussInBoots
- Master | Next Rank: 500 Posts
- Posts: 157
- Joined: Tue Oct 07, 2008 5:47 am
- Thanked: 3 times
Plugging in the numbers should take you no more than 30-40 seconds. If anything, this problem is a gift.