Let $Li_s(z)$ denote the usual polylogarithm. The elementary functional equation $$Li_{-n}(z)=(-1)^{n-1}Li_{-n}(1/z)$$ holds for $n\geq 1$. I remember only that the proof used some reproducing property of the Stirling numbers of the second kind.

This functional equation is rather useful because, taking linear combinations, it amounts to saying that a meromorphic function having a power series on the open unit disc whose coefficients are the values of a polynomial $f$ of degree $d$ evaluated at integer arguments:

$$\sum_{k=0}^{\infty}f(k)z^k=\frac{1}{(1-z)^{d+1}}\sum_{k=0}^{d}\left(\sum_{j=0}^k{d+1\choose j}(-1)^jf(k-j)\right)z^k$$

is defined for $|z|>1$ by the series

$$-\sum_{k=1}^{\infty}f(-k)z^{-k}.$$

I would like to know how this functional equation (or the continuation by sum over negative powers) can be proved?

Please note that the use of statements like

$$\sum_{k=-\infty}^{\infty}k^nz^k=\left(z\frac{d}{dz}\right)^n\sum_{k=-\infty}^{\infty}z^k=\left(z\frac{d}{dz}\right)^n 0=0$$ is acceptable only if you can also prove that the sums of positive and negative powers converge on a common arc of the unit circle.

In his answer below, Fedor Petrov has pointed out that the use of divergent series as formal generating functions is justified in some cases, so the last statement is incorrect.

Enumerative Combinatorics, Volume I, Second Edition, Proposition 4.2.3, p. 469. (There is a typo in the statement of the proposition: $\sum_{n\ge0} f(n)$ should be $\sum_{n\ge0} f(n) x^n$.) $\endgroup$