TOPICS
Search

Ordered Bell Number


The ordered Bell number a_n, also called the Fubini number, counts the lists of disjoint nonempty subsets whose union is a fixed n-element set. Here n is a nonnegative integer, and a_0=1 counts the empty list. Unlike the Bell numbers, these numbers distinguish different orders of the blocks.

For n=0, 1, ..., the first values are 1, 1, 3, 13, 75, 541, 4683, 47293, ... (OEIS A000670). A set partition with k blocks has k! possible block orders, giving

 a_n=sum_(k=0)^nk!S(n,k),
(1)

where S(n,k) is a Stirling number of the second kind. As an identity of formal power series, and analytically for |x|<ln2, the exponential generating function is

 sum_(n=0)^inftya_n(x^n)/(n!)=1/(2-e^x).
(2)

Choosing the first nonempty block gives the recurrence relation

 a_n=sum_(j=1)^n(n; j)a_(n-j)
(3)

for n>=1, where (n; j) is a binomial coefficient.

These numbers count the button codes in the combination lock model, where each block consists of the buttons pressed simultaneously and the block order specifies the sequence of presses (Velleman and Call 1995).


See also

Bell Number, Combination Lock, Frustrated Parking Function, Set Partition, Stirling Number of the Second Kind

Explore with Wolfram|Alpha

References

Sloane, N. J. A. Sequence A000670 in "The On-Line Encyclopedia of Integer Sequences."Velleman, D. J. and Call, G. S. "Permutations and Combination Locks." Math. Mag. 68, 243-253, 1995.

Cite this as:

Weisstein, Eric W. "Ordered Bell Number." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/OrderedBellNumber.html

Subject classifications