×

Evaluating the binary partition function when \(N=2^n\). (English) Zbl 0904.05010

Summary: We present a linear algorithm to count the number of binary partitions of \(2^n\). It is also shown how such binary partitions are related to closure spaces on \(n\) elements, thereby giving a lower bound on their enumeration as well.

MSC:

05A17 Combinatorial aspects of partitions of integers
PDF BibTeX XML Cite