Result
S(n,k)
=
-
About Stirling Numbers
Stirling numbers of the second kind, denoted as S(n,k), represent the number of ways to partition a set of n elements into k non-empty subsets.
For example, S(3,2) = 3 because there are three ways to partition a set of 3 elements into 2 non-empty subsets.
Note: For large values of n and k, the result might be too large to be displayed accurately.