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

A234217

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

Terms

    a(0) =72a(1) =308a(2) =308a(3) =1248a(4) =1540a(5) =1248a(6) =5344a(7) =7348a(8) =7348a(9) =5344a(10) =21888a(11) =38424a(12) =40384a(13) =38424a(14) =21888a(15) =93760a(16) =190188a(17) =257116a(18) =257116a(19) =190188a(20) =93760a(21) =385536a(22) =1029224a(23) =1493960a(24) =2047712a(25) =1493960a(26) =1029224a(27) =385536a(28) =1651712a(29) =5219076

External references