Bell Numbers
Bn is the number of set partitions of an n element set.
A000110 on the OEIS
Basic Recurrence
B0=1
Bn+1=k=0∑n(kn)Bk
Bn=e1k=0∑∞k!kn
Bn=k=1∑nk!knj=0∑n−kj!(−1)j
Bn=k=0∑n{kn}
where {kn} is a Stirling Number of the second kind
Generating functions
Exponential generating function
B(x)=n=0∑∞n!Bnxn=eex−1
Software
https://rosettacode.org/wiki/Bell_numbers
Articles
https://en.wikipedia.org/wiki/Bell_number
Blog posts
Talks about computing bell numbers efficiently.
https://fredrikj.net/blog/2015/08/computing-bell-numbers/