For given $M$, I would like to find $$\sum_{\stackrel{i + j = M}{i < j}} \frac{1}{i}\frac{1}{j}.$$
I'm solving the problem programatically ATM, with a single for loop for any given $M$, and I want to solve it for all $M \in \{ 2, \ldots, N \}$ for large $N$, say $10^6$ or $10^7$. An approximation would be ok, or a dynammic programming solution. However, solving it using two for loops is not an option, even when $N$ is as small as about $10^4$.
I've tried using formal power series, but I'm really weak in this area, so I couldn't derive the sought expression. Is this the way to go?