Hypermaps and indecomposable permutations

It is shown that the number of hypermaps of size n, that is the number of ordered pairs of permutations generating a transitive subgroup of S"n, is equal to (n-1)! times the number of indecomposable permutations of S"n"+"1. The proof is elementary.