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

A233665

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

Terms

    a(0) =208a(1) =1220a(2) =1220a(3) =6656a(4) =8324a(5) =6656a(6) =37544a(7) =56212a(8) =56212a(9) =37544a(10) =208304a(11) =411848a(12) =501200a(13) =411848a(14) =208304a(15) =1166748a(16) =3007000a(17) =5005852a(18) =5005852a(19) =3007000a(20) =1166748a(21) =6498312a(22) =22597004a(23) =50997688a(24) =71366708a(25) =50997688a(26) =22597004a(27) =6498312a(28) =36324956

External references