If $a$ is integer and $\textbf{i} b$ is not integer then:
$\sum_{k=1}^{n}\frac{1}{a i k+b}=-\frac{1}{2b}+\frac{1}{2(a i n+b)}+\frac{2\pi}{e^{2\pi b}-1}\int_{0}^{1}e^{\pi(a i n+2b)u}\sin{(\pi a n u)}\cot{(\pi a u)}\,du$
(If $a$ is not integer we can make it integer by putting it in evidence.)
As some examples of applications, we can use the above to produce the curious formula below:
\begin{multline} \sum_{k=1}^{n}\frac{1}{k^2+2k+2}=-\frac{1}{4}+\frac{1}{2(n^2+2n+2)}+\\\frac{2\pi}{e^{4\pi}-1}\int_{0}^{1}\left[e^{4\pi(1-u)}+e^{4\pi u}\right]\cos{2\pi(n+2)u}\sin{2\pi n(1-u)}\cot{2\pi(1-u)}\,du \end{multline}
Or the below:
$\sum_{k=1}^{n}\frac{1}{k^2+1}=-\frac{1}{2}+\frac{1}{2(n^2+1)}+\frac{4\pi}{e^{4\pi}-1}\int_{0}^{1} e^{4\pi u}\cos{[2\pi n(1-u)]}\sin{(2\pi n u)}\cot{(2\pi u)}\,du$
I have two questions:
a) How do you get the same complex harmonic progression using $\psi$?
b) If we know all the roots of $x^{2k}+1=0$, and a linear combination such that $\sum_{j}c_j/(x-x_j)=1/(x^{2k}+1)$, we can produce a formula for $\sum_{j}1/(j^{2k}+1)$. Is such a linear combination known?
Not an answer but a remark about b) :
Let us give the name $f(x):=x^{2k}+1$
There exists an identity having the form
$$\sum_{j}\dfrac{c_j}{(x-x_j)}=\dfrac{1}{(x^{2k}+1)}=\dfrac{1}{f(x)}$$
and its coefficients are unique. They are :
$$c_j=\dfrac{1}{2k(x_j)^{2k-1}}=\dfrac{1}{f^{\prime}(x_j)}$$
(by computation of the residue at a simple pole, as usually done in complex function theory).
An example : using formula above for $k=2$, with $w:=e^{i \pi/4}$, one gets
$$\dfrac{1}{(x^{4}+1)}=\dfrac14\left(\dfrac{w^{-3}}{(x-w)}+\dfrac{w^{-1}}{(x-w^3)}+\dfrac{w}{(x-w^5)}+\dfrac{w^{3}}{(x-w^7)}\right)$$
I have no idea if the formulas you deduce are classical or not.
Edit : an idea concerning the first formula (may be a deadend)
As the initial part of your formula is of the form :
$$\sum _{i=m}^{n}f(i)={\frac {f(n)+f(m)}{2}}+\int _{m}^{n} something$$
I have seen a connection with the powerful Euler-MacLaurin formula. I copy-paste it from the corresponding Wikipedia article : https://en.wikipedia.org/wiki/Euler%E2%80%93Maclaurin_formula
$$\displaystyle \sum _{i=m}^{n}f(i)=\int _{m}^{n}f(x)\,dx+{\frac {f(n)+f(m)}{2}}+\sum _{k=1}^{\lfloor p/2\rfloor }{\frac {B_{2k}}{(2k)!}}\underbrace{(f^{(2k-1)}(n)-f^{(2k-1)}(m))}_{A}+R_{p}$$
where the $B_{2k}$ are Bernoulli numbers.
Of course, there would be some transformation work, but I think it is valuable to try it. Ideally if all the derivatives'values in part denoted $A$ are zero, it is perfect because we don't have to cope with Bernoulli numbers...