3-level binary fanout 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,3 1,4 0,2 2,5 2,6 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.

A223419

3-level binary fanout 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,3 1,4 0,2 2,5 2,6 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.

Terms

    a(0) =48a(1) =464a(2) =4720a(3) =47872a(4) =486016a(5) =4934272a(6) =50097024a(7) =508632832a(8) =5164146176a(9) =52431620096a(10) =532338988032

External references