4 X 4 square grid graph coloring a rectangular array: number of n X 1 0..15 arrays where 0..15 label nodes of the square grid graph and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.

A223395

4 X 4 square grid graph coloring a rectangular array: number of n X 1 0..15 arrays where 0..15 label nodes of the square grid graph and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.

Terms

    a(0) =16a(1) =48a(2) =152a(3) =488a(4) =1576a(5) =5096a(6) =16488a(7) =53352a(8) =172648a(9) =558696a(10) =1807976a(11) =5850728a(12) =18933352a(13) =61269608a(14) =198272616a(15) =641623656a(16) =2076337768a(17) =6719170152a(18) =21743691368a(19) =70364063336a(20) =227702892136a(21) =736862037608

External references