Fubini Number Calculator

Weak orderings of [n]

CalculatorsFreeNo Signup
4.4(849 reviews)
All Tools

Loading tool...

About Fubini Number Calculator

A Fubini number calculator computing a(n) = Σ_{k=0}^{n} S(n,k)·k! where S=Stirling second kind. a(0)=1, a(1)=1, a(2)=3, a(3)=13, a(4)=75. Counts weak orderings, preferential arrangements, surjections. Client-side.

Fubini Number Calculator Features

  • a(n) value
  • Sequence
  • Weak orderings
  • Stirling sum
  • Growth rate
Fubini numbers (ordered Bell): a(n) = Σ S(n,k)·k!. Count weak orderings of [n]: total orders allowing ties. a(3)=13: one 3-way tie, six 2+1 orderings, six strict orderings. Also: number of faces of the permutohedron.

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

  1. 1Enter n.
  2. 2Compute a(n).
  3. 3View sequence.
  4. 4See breakdown.
  5. 5Check growth.

Fubini Number Calculator — Frequently Asked Questions

Why 'Fubini' numbers?+

Named after Guido Fubini who studied ordered partitions. Also called 'ordered Bell numbers' because Bell numbers count unordered partitions and Fubini = Bell × ordering. The connection: a(n) = Σ B_{n,k}·k! where B_{n,k} is a partial Bell number.

What's a weak ordering?+

A total order allowing ties. For {a,b,c}: strict orderings like a<b<c (6 total), orderings with one tie like a<b=c (6 total), and the single 3-way tie a=b=c. Total: 6+6+1=13=a(3).

How fast do they grow?+

a(n) ~ n!/(2(ln 2)^{n+1}). This is faster than n! by a factor of 1/(2(ln 2)^{n+1}), which grows superexponentially. a(10) = 102,247,563. They grow roughly n!/0.693^n.

Share this tool: