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

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

Offset: 0

Author

Aalok Sathe, Jul 24 2019

Keywords

• nonn
• more

Links

• Prateek Bhakta, Benjamin Brett Buckner, Lauren Farquhar, Vikram Kamat, Sara Krehbiel, Heather M. Russell, Cut-Colorings in Coloring Graphs, Graphs and Combinatorics, (2019) 35(1), 239-248.
• Luis Cereceda, Janvan den Heuvel, 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

Crossrefs

Cf. A334159.

Formula

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

Extensions

a(6) from Andrew Howroyd, Apr 23 2020