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

A223255

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

Terms

    a(0) =5a(1) =12a(2) =12a(3) =32a(4) =52a(5) =32a(6) =80a(7) =236a(8) =236a(9) =80a(10) =208a(11) =1076a(12) =2172a(13) =1076a(14) =208a(15) =528a(16) =4908a(17) =17828a(18) =17828a(19) =4908a(20) =528a(21) =1360a(22) =22388a(23) =166892a(24) =307144a(25) =166892a(26) =22388a(27) =1360a(28) =3472a(29) =102124

External references