A334359 - OEIS

A334359

Number of stable partitions of the n-hypercube graph.

1, 1, 4, 354, 179185930, 258823757396708888836788

(list; graph; refs; listen; history; text; internal format)

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

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 2-dimensional hypercube are:

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

| | | | | | | |

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

CROSSREFS

Row sums of A334159.

Sequence in context: A377538 A214182 A214233 * A203034 A215827 A366469

Adjacent sequences: A334356 A334357 A334358 * A334360 A334361 A334362

KEYWORD

nonn

AUTHOR

Andrew Howroyd, Apr 25 2020

STATUS

approved