T(n,k)=3X3 square grid graph coloring a rectangular array: number of nXk 0..8 arrays where 0..8 label nodes of the square grid graph and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.
A223379
T(n,k)=3X3 square grid graph coloring a rectangular array: number of nXk 0..8 arrays where 0..8 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) =9a(1) =24a(2) =24a(3) =68a(4) =144a(5) =68a(6) =192a(7) =912a(8) =912a(9) =192a(10) =544a(11) =5808a(12) =13232a(13) =5808a(14) =544a(15) =1536a(16) =37008a(17) =192752a(18) =192752a(19) =37008a(20) =1536a(21) =4352a(22) =235824a(23) =2812608a(24) =6443888a(25) =2812608a(26) =235824a(27) =4352a(28) =12288a(29) =1502736
External references
- oeis: A223379