I did the integral $$I_{k,n}=\int_0^\infty \frac{\log^k(x)}{x^n+1}\,\mathrm dx, k\in\mathbb{N}, n\in\mathbb{N}, n\geq 2$$ via a wedge contour, which gives a recursive definition for $I_{k,n}$ in terms of all previous $I_{j,n}$. Using induction it can be proved that $$I_{2k,n}={\left(\frac{\pi}{n}\right)}^{2k+1}P_{2k}\left(\csc\left(\frac{\pi}{n}\right)\right)$$ and $$I_{2k+1,n}=-{\left(\frac{\pi}{n}\right)}^{2k+2}P_{2k+1}\left(\csc\left(\frac{\pi}{n}\right)\right)\cot\left(\frac{\pi}{n}\right)$$ where $P_k$ is the polynomial sequence of interest. Applying this gives a recursive definition for the sequence: $$P_k={(-1)}^\frac{k}{2}x+x^2\sum_{m=0}^{\frac{k}{2}-1}{k\choose 2m+1}{(-4)}^{\frac{k}{2}-m-1}P_{2m+1}+\sum_{m=0}^{\frac{k}{2}-1}{(-4)}^{\frac{k}{2}-1}\left(2{k\choose 2m}P_{2m}-{k\choose 2m+1}P_{2m+1}\right)$$ for even $k$ and $$P_k=-\sum_{m=1}^{\frac{k-1}{2}}{k\choose 2m-1}2^{k-2m}{(-1)}^{\frac{k-1}{2}-m}P_{2m-1}+\sum_{m=0}^{\frac{k-1}{2}}{k\choose 2m}2^{k-2m-1}{(-1)}^{\frac{k-1}{2}-m}P_{2m}$$ for odd $k$, assuming I have made no mistakes in copying things over. Of interest to me is two things:
- Showing that the imaginary part of the recursive definition cancels out for all $k$. I have omitted the full recursive definition, but clearly since it is a real integral the imaginary part must cancel, though I am uncertain about how to show it. Perhaps there are some interesting binomial coefficient properties which would help.
- Whether or not these polynomials show up elsewhere or have a definition which is more simple. The highest degree coefficient is always $k!$, but other than that I can’t see anything. The first few polynomials are: \begin{align} P_0&=x\\ P_1&=x\\ P_2&=2x^3-x\\ P_3&=6x^3-5x\\ P_4&=24x^5-36x^3+17x\\ P_5&=120x^5-220x^3+169x \end{align}
If anyone recognizes these I would be grateful.