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

A206685

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

Terms

    a(0) =81a(1) =306a(2) =306a(3) =1404a(4) =1728a(5) =1404a(6) =5352a(7) =9792a(8) =9792a(9) =5352a(10) =24336a(11) =55836a(12) =89022a(13) =55836a(14) =24336a(15) =93696a(16) =317736a(17) =645144a(18) =645144a(19) =317736a(20) =93696a(21) =422016a(22) =1809324a(23) =5747676a(24) =7423464a(25) =5747676a(26) =1809324a(27) =422016a(28) =1639296a(29) =10300608

External references