T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 2 (2 maximizes T(1,1)).

A233644

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 2 (2 maximizes T(1,1)).

Terms

    a(0) =24a(1) =90a(2) =90a(3) =324a(4) =534a(5) =324a(6) =1188a(7) =3004a(8) =3004a(9) =1188a(10) =4320a(11) =17424a(12) =26192a(13) =17424a(14) =4320a(15) =15768a(16) =99380a(17) =238570a(18) =238570a(19) =99380a(20) =15768a(21) =57456a(22) =572192a(23) =2118568a(24) =3455622a(25) =2118568a(26) =572192a(27) =57456a(28) =209520a(29) =3277236

External references