I'm working a lot with series these days, and I would like to know if there are any texts, papers, articles that might suggest a general outline for finding $n$th partial sums of convergent series. Most of my searching turns up methods for finding the sums of geometric/telescoping/power series etc., but I'd like to know if there are any general guidelines that are followed for finding partial sums for something like $$\sum_{k=1}^{\infty}\frac{1}{k^2}$$ or $$\sum_{k=1}^{\infty}\frac{6^k}{(3^{k+1}-2^{k+1})(3^k-2^k)}$$.
I've seen solutions to both of these, and they're beautiful and unintuitive. So I wonder what, if any, methods might be used to get an edge on finding their $n$th sums.
Aside from listing partial sums and looking for patterns, what approaches do mathematicians commonly use to solve problems like this? Or, if listing partial sums is the best route to take, what can or should be done to improve pattern recognition?
An excellent resource for learning how do do such things is Concrete Mathematics, by Graham, Knuth and Patashnik. Section 5.8, on Mechanical SUmmation and Gosper's method, gives a very general way to attack such problems.
However, be aware that many such partial sums have no nice closed form, even when the infinite sum does have a nice closed form. For example, while $$\sum_1^\infty \frac1{n^2} = \frac{\pi^2}6$$ I know of no nice form for $$H_{2,k} = \sum_1^k\frac1{n^2} $$ (other than the fact that people have named this function the harmonic number of order 2).