Counts minimally unsatisfiable (MU) k-SAT formulas via brute-force enumeration, and via a closed-form formula for 2-SAT. An MU formula is an unsatisfiable CNF where removing any single clause restores satisfiability — equivalently, a formula that is its own Minimal Unsatisfiable Subset (MUS).