A223210 3X3X3 triangular graph coloring a rectangular array: number of n X n 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,2 1,2 1,3 1,4 2,4 3,4 2,5 4,5 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.
6, 126, 15498, 9640008, 32213930742, 568826898735456, 53598993642186546600, 26904643609262481062550540, 72104047201942444207678110553554, 1031832360324996701256333234422715357000
Offset: 1
Keywords
Examples
Some solutions for n=3 ..3..4..3....2..4..2....2..4..2....2..0..1....1..4..3....0..2..0....4..3..4 ..4..1..4....4..2..1....4..3..4....4..2..4....0..1..4....2..4..1....2..4..2 ..1..2..1....3..1..3....5..4..3....2..4..1....2..4..1....4..1..2....4..3..4
Comments