When you see a complex recurrence relation, try to rearrange it or define a new sequence to simplify it.
The transformation \(b_{n+1} \pm f(n+1) = r (b_n \pm f(n))\) is a powerful method. Here, \(b_n = a_n\) and \(f(n)=-1/n^2\) with \(r=1/2\) worked perfectly.
Also, be aware that Subjective Answer Type questions can sometimes have non-integer answers, though it's rare. A likely intended question for an integer answer might have been \(\sum (2a_n - 2/n^2)\), which would have resulted in a sum of 0.