login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A307334 Number of 3-colorings of an n-dimensional hypercube. 1
3, 6, 18, 114, 2970, 1185282, 100301050602 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

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

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

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: A220816 A038060 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 1 03:36 EDT 2020. Contains 337441 sequences. (Running on oeis4.)