While computing conditional expectations of certain functionals of a Poisson white noise field (details are long and probably irrelevant), I've stumbled upon the need to use the following identity involving Stirling numbers of the second kind: $$ \ell{k\brace \ell} = \sum_{j=\ell}^k {k\choose j1} (1)^{kj} {j\brace \ell}. $$ I used Manuel Kauers' Stirling package in order to produce a recurrence relation from which the identity can be easily proved. I still wonder, however, whether this is actually wellknown, or there is some short proof...

1$\begingroup$ Looks similar to identity $(6.17)$ from Graham, Knuth, Patashnik's book. $\endgroup$– NeganDec 5 '17 at 16:42
You can give a short proof by interpreting the identity as an instance of inclusionexclusion. The left hand side counts the number of ways of partitioning $S=\{1,2,\dots,k\}$ into $\ell$ parts and then picking one of the parts as the designated one.
Let $A_i$ denote the number of partitions of $S$ into $\ell$ parts where the designated part contains $i$. You can check that the left hand side is counting $A_1\cup A_2\cup \cdots \cup A_k$. For the right hand side notice that $$A_{i_1}\cap A_{i_2}\cap\cdots\cap A_{i_r}={kr+1\brace \ell}$$ So by inclusionexclusion we get $$A_1\cup A_2\cup \cdots \cup A_k=\sum_{r=1}^{kl+1}(1)^{r1}\binom{k}{r}{kr+1\brace \ell}$$ and reindexing by $j=kr+1$ gives your identity.
The identity can be proved by equating coefficients of $z^k/k!$ in $$ l \frac{(e^z1)^l}{l!}= (1e^{z}) \frac{d\ }{dz} \frac{(e^z1)^l}{l!}.$$