%I #47 Apr 23 2020 19:25:11
%S 3,6,18,114,2970,1185282,100301050602
%N Number of 3-colorings of an n-dimensional hypercube.
%H Prateek Bhakta, Benjamin Brett Buckner, Lauren Farquhar, Vikram Kamat, Sara Krehbiel, Heather M. Russell, <a href="https://doi.org/10.1007/s00373-018-1985-6">Cut-Colorings in Coloring Graphs</a>, Graphs and Combinatorics, (2019) 35(1), 239-248.
%H Luis Cereceda, Janvan den Heuvel, Matthew Johnson, <a href="https://doi.org/10.1016/j.disc.2007.07.028">Connectedness of the graph of vertex-colourings</a>, Discrete Mathematics, (2008) 308(5-6), 913-919.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/HypercubeGraph.html">Hypercube Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/VertexColoring.html">Vertex Coloring</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Chromatic_polynomial">Chromatic polynomial</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Hypercube">Hypercube</a>
%F a(n) = 3*A334159(n,1) + 6*A334159(n,2) + 6*A334159(n,3). - _Andrew Howroyd_, Apr 23 2020
%Y Cf. A334159.
%K nonn,more
%O 0,1
%A _Aalok Sathe_, Jul 24 2019
%E a(6) from _Andrew Howroyd_, Apr 23 2020