Bell Number Calculator

About this calculator

The Bell number Bn counts the total number of ways to partition a set of n distinct elements into non-empty, unlabeled subsets — every possible way of grouping the elements, regardless of order between or within groups. Bell numbers grow explosively (B0=1, B1=1, B2=2, B3=5, B4=15, B5=52...) and are most efficiently computed with the Bell triangle, a Pascal's-triangle-like construction where each row's first entry is the last entry of the previous row, and this calculator builds that triangle to compute Bn exactly for n up to 25.

Bell numbers are a foundational object in combinatorics and set theory courses, appearing whenever a problem asks “in how many ways can this set be grouped” — from counting equivalence relations on a set to enumerating rhyme schemes in poetry (a genuinely used application) and analyzing partition lattices in abstract algebra. They also show up in computer science when counting the number of ways to partition data into clusters without predetermined cluster labels.