SoFi

Count Same-Bit Numbers

Members only

OA combinatorics problem: for `n`, count integers up to the next all-ones bitmask that have the same number of set bits as `n`, excluding `n` itself.