3-level binary fanout graph coloring a rectangular array: number of n X 3 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.

A223418

3-level binary fanout graph coloring a rectangular array: number of n X 3 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) =26a(1) =136a(2) =868a(3) =4720a(4) =29912a(5) =163168a(6) =1033328a(7) =5638336a(8) =35704800a(9) =194827648a(10) =1233740224a(11) =6732071680a(12) =42630619008a(13) =232619832832

External references