3-loop graph coloring a rectangular array: number of n X 4 0..6 arrays where 0..6 label nodes of a graph with edges (0,1), (1,2), (2,0), (0,3), (3,4), (4,0), (0,5), (5,6), and (6,0), and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.

A223243

3-loop graph coloring a rectangular array: number of n X 4 0..6 arrays where 0..6 label nodes of a graph with edges (0,1), (1,2), (2,0), (0,3), (3,4), (4,0), (0,5), (5,6), and (6,0), and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.