Choosing without order

The number of ways to choose $k$ objects from $n$, ignoring order, is $\binom{n}{k} = n!/(k!(n-k)!)$.

Each selection of $k$ objects can be ordered in $k!$ ways, so $\binom{n}{k}\cdot k!$ counts the ordered lists.