aut js is is the number of automorphisms of a permutation with
cycle type js (i.e. a permutation which has n cycles of size
i for each (i,n) in js). Another way to look at it is that
there are n!/aut js permutations on n elements with cycle type
js. The result type is a FactoredRational.T.

Generate all partitions of an integer. In particular, if p is
an element of the list output by intPartitions n, then sum
. map (uncurry (*)) $ p == n. The result type is [CycleType]
since each integer partition of n corresponds to the cycle type
of a permutation on n elements.

The partitions are generated in an order corresponding to
the Ord instance for Monomial.