How to find the exact number of possible ways to represent a factorial as a product of three consecutive natural numbers?
$$m \cdot (m+1) \cdot (m+2) = n!$$
where $m, n \in \mathbb{N}$
I found these cases:
$1 \cdot 2 \cdot 3 = 3!\\2 \cdot 3 \cdot 4 = 4!\\4 \cdot 5 \cdot 6 = 5!\\8 \cdot 9 \cdot 10 = 6!$
But I need to find the exact number of all possible cases using some formula (or maybe prove that there are only four cases).