The number d(n) of monotone Boolean functions of n variables (equivalent to one more than the number of antichains on the n-set {1, 2, ..., n}) is called the nth Dedkind number. For n = 0, 1, ..., d(n) is given by 2, 3, 6, 20, 168, 7581, 7828354, 2414682040998, 56130437228687557907788, 286386577668298411128469151667598498812366, ... (OEIS A000372). The numbers and their discovers are summarized in the following table. The last of these values was found by Jäkel using 5311 GPU-hours and 4257682565 matrix multiplications on Nvidia A100 GPUs.

antichain | Boolean function | Dedekind's problem