Use 50% Discount for all private proxies!
Unlimited possibilities with ExtraProxies

Is there another way of expressing $\sum\limits_{k=1}^n \binom{n}{k} \cdot (n-k)! \cdot k!$?

I have stumbled across the formula $ \sum\limits_{k=1}^n \binom{n}{k} \cdot (n-k)! \cdot k!$ in some applied context. It looks as though there might be a nice combinatorial background to this formula. Is there another way to express it? Maybe a term that only depends on n? I am thinking of the famous equation expressing $ 2^n$ as a sum of binomial coefficients and I am hoping that this may be a similar (albeit more complicated) instance. TIA!

Related Posts
DreamProxies 100 Proxies 200 Proxies 400 Proxies 1000 Proxies 2000 Proxies 5000 Proxies 10000 Proxies