Recursionhard
0:00.0

The Stirling numbers of the second kind S(n,k)S(n,k) satisfy the recurrence: S(n,k)=kS(n1,k)+S(n1,k1)S(n,k) = k \cdot S(n-1,k) + S(n-1,k-1) with S(0,0)=1S(0,0) = 1 and S(n,0)=0S(n,0) = 0 for n>0n > 0. What is S(4,2)S(4, 2)?