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 n-hypercube graph with any number of unlabeled colors. The vertices are not interchangeable.

LINKS

Eric Weisstein's World of Mathematics, Hypercube Graph

EXAMPLE

The a(2) = 4 stable partitions of the 2-dimensional hypercube are:

1---2 1---2 1---2 1---2

| | | | | | | |

2---1 2---3 3---1 3---4

CROSSREFS

KEYWORD

nonn

AUTHOR

Andrew Howroyd, Apr 25 2020

STATUS

approved