Gender of Boolean functions

Studies of Boolean functions

A Boolean function shall be called male, iff its root is sharp (i. e. iff its compressed truth table has odd weight).
(Equivalently, it is female, iff after removing all repetitions, the weight of the truth table is still even.)

gender ratio for arities 0...5

For positive arities, there are more males than females. The imbalance peaks for arity 2. For higher arities, the ratio is almost balanced.
The ratio is balanced for the infinite set of all Boolean functions. Both sets are countable, so there is a trivial bijection. But is there a meaningful bijection?

The number triangles in the following boxes show the numbers of Boolean functions by arity/adicity and valency.
Row indices on the left (🌊) are the arity, on the right (💧) the adicity. Entries on the left are the sums of columns on the right.
These triangles are based on Pascals triangle, with columns multiplied by consecutive entries of a sequence, which becomes the diagonal.

Lotus (A000371, the number of dense BF) is surprisingly the sum of a signed version of Cedar.