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.

1, 2, 8, 154, 89512, 71319425714

Offset

0,2

References

D. E. Knuth, personal communication.

Links

Table of n, a(n) for n=0..5.

Noga Alon and Jozsef Balogh, Partitioning the hypercube into smaller hypercubes, arXiv:2401.00299 [math.CO], 2023.

Florian Bridoux, Maximilien Gadouleau, and Guillaume Theyssier, Commutative automata networks, arXiv:2004.09806 [cs.CC], 2020.

Sean A. Irvine, Java program (github).

Index entries for sequences related to Boolean functions

Crossrefs

Sequence in context: A012298 A009596 A012571 * A012432 A071097 A012537

Adjacent sequences: A018923 A018924 A018925 * A018927 A018928 A018929

Keyword

nonn,more

Author

N. J. A. Sloane

Extensions

a(5) from Sean A. Irvine, Feb 21 2019

Status

approved