Determine the number of permutations $\sigma$ of $\{1, 2, 3, 4, 5, 6\}$ such that $\sigma(i) < \sigma(i+1)$ is false for all $i$ (i.e., the permutation is strictly decreasing).