T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with each 2X2 subblock having the number of clockwise edge increases less than or equal to the number of counterclockwise edge increases.
A234796
T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with each 2X2 subblock having the number of clockwise edge increases less than or equal to the number of counterclockwise edge increases.
Terms
- a(0) =204a(1) =2504a(2) =2504a(3) =30536a(4) =88072a(5) =30536a(6) =371976a(7) =3015344a(8) =3015344a(9) =371976a(10) =4530424a(11) =102517088a(12) =280996212a(13) =102517088a(14) =4530424a(15) =55175944a(16) =3479085232a(17) =25695321008a(18) =25695321008a(19) =3479085232a(20) =55175944a(21) =671983416a(22) =118012659040
External references
- oeis: A234796