Recursionhard
0:00.0

The Bell numbers BnB_n (counting set partitions of nn elements) satisfy the recurrence: Bn+1=k=0n(nk)BkB_{n+1} = \sum_{k=0}^{n} \binom{n}{k} B_k with B0=1B_0 = 1. Compute B3B_3.