T(n,k) = number of (n+1) X (k+1) 0..3 arrays with every 2 X 3 or 3 X 2 subblock having an equal number of clockwise and counterclockwise edge increases.
A206752
T(n,k) = number of (n+1) X (k+1) 0..3 arrays with every 2 X 3 or 3 X 2 subblock having an equal number of clockwise and counterclockwise edge increases.
Terms
- a(0) =256a(1) =1888a(2) =1888a(3) =15680a(4) =36384a(5) =15680a(6) =139744a(7) =793152a(8) =793152a(9) =139744a(10) =1289472a(11) =18037344a(12) =43894936a(13) =18037344a(14) =1289472a(15) =12105120a(16) =415429504a(17) =2475217568a(18) =2475217568a(19) =415429504a(20) =12105120a(21) =114566336a(22) =9604042208a(23) =140074119984
External references
- oeis: A206752