How to Use
Enter n:
- a(n): Fubini number
- Sequence: First values
- Breakdown: By number of tiers
Interpretations
a(n) counts: (1) Weak orderings of [n]. (2) Ordered set partitions. (3) Surjections from [n] to [k] summed over k. (4) Faces of the permutohedron. (5) Preferential arrangements (ranking with ties).
Formulas
a(n) = Σ_{k=0}^n k!·S(n,k). EGF: 1/(2-e^x). Recurrence: a(n) = Σ C(n,k)·a(n-k) for k=1..n. Asymptotic: a(n) ~ n!/(2·(ln2)^{n+1}).
Step-by-Step Instructions
- 1Enter n.
- 2Compute a(n).
- 3View sequence.
- 4See breakdown.
- 5Check growth.