  We present an algorithmic mapping from permutations of length dn to labeled
n-node d-ary trees and back again. Given such a bijection, one can interpret
each of the factorials in the formula for the Catalan numbers as a count of
permutations.
