How many ways can n couples stand in a line so that no one stands besides their spouse?

407 Views Asked by At

Trying to work out this problem:

The answer is the summation from $k = 0$ to $n$ for $(-1)^k \binom {n} {k} (2n - k)! \ 2^k $