Bell number - the number of all unordered partitions -element set denoted by , while by definition .
Values for form the sequence [1] :
- 1, 1 , 2 , 5 , 15 , 52 , 203, 877 , 4140, 21 147, 115 975, ...
The Bell number can be calculated as the sum of Stirling numbers of the second kind :
- ,
and also set in recursive form:
- .
For Bell numbers, the Dobinsky formula is also valid [2] :
- .
If - simple, the comparison of Tushar is true:
and more general:
- .
The exponential generating function of Bell numbers has the form [3] :
- .
Notes
- β sequence A000110 in OEIS
- β Introduction to Discrete Mathematics, 2006 , p. 202.
- β Introduction to Discrete Mathematics, 2006 , p. 200.
Literature
- Yablonsky S.V. Introduction to discrete mathematics. - M .: Higher school, 2006 .-- 392 p. - ISBN 5-06-005683-X .