T(n,k)=4-loop graph coloring a rectangular array: number of nXk 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.

A223297

T(n,k)=4-loop graph coloring a rectangular array: number of nXk 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.

Terms

    a(0) =9a(1) =24a(2) =24a(3) =96a(4) =168a(5) =96a(6) =288a(7) =1368a(8) =1368a(9) =288a(10) =1056a(11) =11304a(12) =42168a(13) =11304a(14) =1056a(15) =3360a(16) =93528a(17) =709320a(18) =709320a(19) =93528a(20) =3360a(21) =11808a(22) =773928a(23) =22346136a(24) =46008720a(25) =22346136a(26) =773928a(27) =11808a(28) =38688a(29) =6404184

External references