About the Project
26 Combinatorial AnalysisProperties

§26.7 Set Partitions: Bell Numbers

Contents
  1. §26.7(i) Definitions
  2. §26.7(ii) Generating Function
  3. §26.7(iii) Recurrence Relation
  4. §26.7(iv) Asymptotic Approximation

§26.7(i) Definitions

B\left(n\right) is the number of partitions of \{1,2,\ldots,n\}. For S\left(n,k\right) see §26.8(i).

26.7.1 B\left(0\right)=1,
Table 26.7.1: Bell numbers.
n B\left(n\right) n B\left(n\right)
0 1 10 1 15975
1 1 11 6 78570
2 2 12 42 13597
3 5 13 276 44437
4 15 14 1908 99322
5 52 15 13829 58545
6 203 16 1 04801 42147
7 877 17 8 28648 69804
8 4140 18 68 20768 06159
9 21147 19 583 27422 05057

§26.7(ii) Generating Function

§26.7(iii) Recurrence Relation

26.7.6 B\left(n+1\right)=\sum_{k=0}^{n}\genfrac{(}{)}{0.0pt}{}{n}{k}B\left(k\right).

§26.7(iv) Asymptotic Approximation

where

or, specifically, N={\mathrm{e}}^{W_{0}\left(n\right)}, with properties of the Lambert W-function W_{0}\left(n\right) given in §4.13. For higher approximations to B\left(n\right) as n\to\infty see de Bruijn (1961, pp. 104–108).