T(n,k) = number of (n+1) X (k+1) 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.

A206118

T(n,k) = number of (n+1) X (k+1) 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.

Terms

    a(0) =256a(1) =1140a(2) =1140a(3) =6028a(4) =5228a(5) =6028a(6) =31756a(7) =22624a(8) =22624a(9) =31756a(10) =171564a(11) =111552a(12) =88596a(13) =111552a(14) =171564a(15) =973388a(16) =588840a(17) =520800a(18) =520800a(19) =588840a(20) =973388a(21) =5538732a(22) =3048096a(23) =2408480a(24) =5048352a(25) =2408480a(26) =3048096a(27) =5538732a(28) =31668844a(29) =16072760

External references