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

A206150

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

Terms

    a(0) =81a(1) =60a(2) =60a(3) =162a(4) =246a(5) =162a(6) =486a(7) =1122a(8) =1122a(9) =486a(10) =1458a(11) =5118a(12) =7812a(13) =5118a(14) =1458a(15) =4374a(16) =23346a(17) =54450a(18) =54450a(19) =23346a(20) =4374a(21) =13122a(22) =106494a(23) =379602a(24) =580986a(25) =379602a(26) =106494a(27) =13122a(28) =39366a(29) =485778

External references