The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A237748 Number of different ways to color the vertices of an n-dimensional hypercube using at most 2 colors. 1
 4, 6, 23, 496, 2275974, 800648638402240, 1054942853799126580390222487977120, 22436153203535039105819651040959324360753617244078062654624560815030272 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Two colorings are regarded as the same if they are conjugated by a permutation of the vertices caused by a rotation of the hypercube. Regarding mirrored coloring also as the same, the number of ways appears to be given by A000616. - Azuma Seiichi, Feb 14 2014 LINKS Table of n, a(n) for n=1..8. Azuma Seiichi, Number of different ways to color vertices of a n-dimensional hypercube using at most K colors EXAMPLE For n=2, there are 6 patterns to color the vertices of the square: ..1..1....1..1....1..1....1..0....1..0....0..0 ..1..1....1..0....0..0....0..1....0..0....0..0 For example, the next pattern is regarded as the same with the 3rd one above: ..1..0 ..1..0 CROSSREFS Cf. A000543. Column 2 of A325012. Sequence in context: A107952 A004032 A123046 * A359863 A326233 A087784 Adjacent sequences: A237745 A237746 A237747 * A237749 A237750 A237751 KEYWORD nonn AUTHOR Azuma Seiichi, Feb 12 2014 STATUS approved

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

Last modified September 24 17:02 EDT 2023. Contains 365579 sequences. (Running on oeis4.)