

A334359


Number of stable partitions of the nhypercube graph.


0




OFFSET

0,3


COMMENTS

A stable partition is a partition of the vertices into sets so that no two vertices in a set are adjacent in the graph.
Equivalently, a(n) is the number of vertex colorings of the nhypercube graph with any number of unlabeled colors. The vertices are not interchangeable.


LINKS

Table of n, a(n) for n=0..5.
Eric Weisstein's World of Mathematics, Hypercube Graph


EXAMPLE

The a(2) = 4 stable partitions of the 2dimensional hypercube are:
12 12 12 12
       
21 23 31 34


CROSSREFS

Row sums of A334159.
Sequence in context: A052391 A214182 A214233 * A203034 A215827 A051955
Adjacent sequences: A334356 A334357 A334358 * A334360 A334361 A334362


KEYWORD

nonn


AUTHOR

Andrew Howroyd, Apr 25 2020


STATUS

approved



