Bell numbers
From HandWiki
This category corresponds roughly to MSC {{{id}}} {{{title}}}; see {{{id}}} at MathSciNet and {{{id}}} at zbMATH.
The Bell numbers $B_0,B_1,\ldots$ are given by
$$\sum_{n=0}^\infty B_n\frac{x^n}{n!}=e^{e^x-1}$$
or by
$$B_{n+1}=\sum_{k=0}^n\binom nkB_k.$$
Also,
$$B_n=\sum_{k=1}^nS(n,k),$$
where $S(n,k)$ are Stirling numbers of the second kind (cf. Combinatorial analysis), so that $B_n$ is the total number of partitions of an $n$-set.
They are equal to $1,1,2,5,15,52,203,877,4140,\ldots$ ((sequence A000110 in the OEIS)).
The name honours E.T. Bell.
References
- L. Comtet, "Advanced combinatorics", Reidel (1974) Template:ZBL
