login
A307334
Number of 3-colorings of an n-dimensional hypercube.
2
3, 6, 18, 114, 2970, 1185282, 100301050602
OFFSET
0,1
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, 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
KEYWORD
nonn,more
AUTHOR
Aalok Sathe, Jul 24 2019
EXTENSIONS
a(6) from Andrew Howroyd, Apr 23 2020
STATUS
approved