Bell Numbers

From Algorithmist
Jump to navigation Jump to search
This is a stub or unfinished. Contribute by editing me.

Bell Numbers, or Bell's Numbers counts the number of ways N objects can be partitioned into groups that are non-empty.

can be defined as the following:

where is the Stirling Number of the Second Kind.

Bell's Triangle[edit]

Bell Numbers can also be calculated using Bell's Triangle.

1 2
2 3 5
5 7 10 15
15 20 27 37 52

The concept behind this is that it can be calculated with only addition - the first column of a number is equal to the last value of the previous row, and subsequential columns' values are from the sum of the value immediately preceding it, and the value on top of that value.

It can also be viewed as a recurrence (-th row, -column)

where the sum of row is -th Bell Number.