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

A233682

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

Terms

    a(0) =48a(1) =184a(2) =184a(3) =648a(4) =928a(5) =648a(6) =2440a(7) =4448a(8) =4448a(9) =2440a(10) =8712a(11) =23568a(12) =28544a(13) =23568a(14) =8712a(15) =32456a(16) =117744a(17) =216592a(18) =216592a(19) =117744a(20) =32456a(21) =116872a(22) =621904a(23) =1500800a(24) =2442208a(25) =1500800a(26) =621904a(27) =116872a(28) =432456a(29) =3145968

External references