|
|
A223296
|
|
4-loop graph coloring a rectangular array: number of n X 7 0..8 arrays where 0..8 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 0,5 5,6 6,0 0,7 7,8 8,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.
|
|
1
|
|
|
11808, 6404184, 11864385048, 12730353920784, 25787363600621016, 27821347292299780344, 56395315109321439563328, 60846019870394597868335400, 123338668226195827949533410312, 133072588038583292864451480249888
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3
..1..0..2..0..5..0..1....1..0..2..0..3..4..3....1..0..2..0..2..0..4
..0..1..0..1..0..1..0....0..1..0..1..0..3..0....0..1..0..2..0..1..0
..1..0..2..0..3..0..1....1..0..2..0..7..0..6....1..0..2..0..1..0..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|