Any time you see a sequence quant question, you should be thinking to yourself, "FIND THE PATTERN." The GMAT isn't testing esoteric formula memorization. In fact, you can solve this problem without knowing anything fancy. I used to freak out when I saw questions like this -- "oh no! Did I not study some blah-blah-blah property about recursive sequences that I need to know???" -- but now I realize that the GMAT is actually giving me very clear instructions on what to look for. I just have to put pen to paper. That mindset changed the game for me.
Almost reflexively, if I see a recursive sequence on the GMAT, I start listing out the first few terms and looking for the pattern. In this case, it emerges after 4-6 terms. At every even-indexed term (a_2, a_4, a_6, etc.) the sum of the series is equal to (x-1)*(half the index number). So the sum of the series at a_20 must be (x-1)*(20/2) = 10(x-1).
(I'm a big fan of using u-substitution to clear things up. I actually replaced "x-1" with "u" when writing things out, and it made this^ pattern a lot more clear. )
The stem tells you that the sum of the series is 60, so the equation immediately condenses to 60 = 10(x-1). Solve for X: X = 7. Answer E.