Computation of Stirling Numbers and Generalizations

We consider the computation of Stirling numbers and generalizations for positive and negative arguments. We describe computational schemes for Stirling Partition and Stirling Cycle numbers, and for their generalizations to associated Stirling numbers. The schemes use recurrence relations and are more efficient than the current method used in Maple for cycle numbers, which is based on an algebraic expansion.