Dobinski's formula, published by G. Dobinski in 1877, expresses the nth Bell number, which counts the partitions of a set of size n, as an infinite series: the sum over all natural numbers k of k raised to the nth power divided by k factorial, with the whole sum then divided by Euler's number e. The formula gives a direct analytic route to the Bell numbers even though the underlying combinatorial quantity is purely discrete.
Facts
StatementDobinski's formula states that the nth Bell number Bn, the number of partitions of a set of size n, equals the sum from k=0 to infinity of k to the n over k factorial, divided by e. 1 Classification
Statement Form Connections
Has Statement Form
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
Sources
1. Dobinski's formula (Wikipedia)
Introduction
Dobi?ski's formula states that the n th Bell number B n , the number of partitions of a set of size n , equals
History
The formula was published by G. Dobinski in 1877
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.