Exact Integer Bell Number Calculator

Construct the Bell triangle from B0 = 1, carrying each row's last value left and summing adjacent predecessor values. The empty labelled set has one partition, which establishes B0 = 1. Inputs must be whole numbers inside the displayed safe bound. The calculator does not round decimals into the domain or silently substitute a different convention, so verify each entered integer before interpreting the exact result.

Elements are distinguishable, blocks are unlabeled, and block order is ignored; integer additive partitions use a different model. Summing S(n,k) from zero through n independently reconstructs the Bell number for the same n. Use the displayed factors, recurrence step, or modular residue as an independent check. Exact integer output means the implemented arithmetic has no decimal approximation within its bound; it does not prove an unrelated theorem or an unstated combinatorial model.

The set size is capped at 20 so every displayed Bell number remains an exact JavaScript safe integer. The bound prevents huge combinatorial counts from being silently rounded by floating-point representation. The bound keeps browser work predictable and every returned integer within JavaScript's exact safe range. Larger inputs need arbitrary-precision software, explicit resource controls, and independent verification rather than treating an overflowed floating-point value as exact.