### Recurrence Relations : Stirling Numbers

A Stirling number Snk is definedc as the number of ways of partitioning the set of positive numbers (1,2,3,....n) into k non empty subsets. We can show that by considering if the singleton subset (n) is a partition or not that Snk = Sn-1, k-1 + kSn-1,k Another recurrence relation comes from considering the number of partit