Number of ways to partition an n-cube into subcubes (without reducing isomorphic cases); number of labeled squashed n-cubes; ways to make a tautology from disjoint terms with n Boolean variables; number of Rivest compression schemes for n-bit retrieval.

A018926

Number of ways to partition an n-cube into subcubes (without reducing isomorphic cases); number of labeled squashed n-cubes; ways to make a tautology from disjoint terms with n Boolean variables; number of Rivest compression schemes for n-bit retrieval.