A307334 Number of 3-colorings of an n-dimensional hypercube.

3, 6, 18, 114, 2970, 1185282, 100301050602

Offset

0,1

Links

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

Prateek Bhakta, Benjamin Brett Buckner, Lauren Farquhar, Vikram Kamat, Sara Krehbiel, and Heather M. Russell, Cut-Colorings in Coloring Graphs, Graphs and Combinatorics, (2019) 35(1), 239-248.

Luis Cereceda, Jan van den Heuvel, and Matthew Johnson, Connectedness of the graph of vertex-colourings, Discrete Mathematics, (2008) 308(5-6), 913-919.

Eric Weisstein's World of Mathematics, Hypercube Graph.

Eric Weisstein's World of Mathematics, Vertex Coloring.

Wikipedia, Chromatic polynomial.

Wikipedia, Hypercube.

Formula

a(n) = 3*A334159(n,1) + 6*A334159(n,2) + 6*A334159(n,3). - Andrew Howroyd, Apr 23 2020

Crossrefs

Cf. A334159.

Sequence in context: A366607 A345134 A135504 * A057268 A085401 A085061

Adjacent sequences: A307331 A307332 A307333 * A307335 A307336 A307337

Keyword

nonn,more

Author

Aalok Sathe, Jul 24 2019

Extensions

a(6) from Andrew Howroyd, Apr 23 2020

Status

approved