T(n,k)=Number of (n+1)X(k+1) 0..5 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)).

A233818

T(n,k)=Number of (n+1)X(k+1) 0..5 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) =96a(1) =428a(2) =428a(3) =1824a(4) =2216a(5) =1824a(6) =8136a(7) =10972a(8) =10972a(9) =8136a(10) =34848a(11) =59164a(12) =61896a(13) =59164a(14) =34848a(15) =155488a(16) =301132a(17) =403108a(18) =403108a(19) =301132a(20) =155488a(21) =667200a(22) =1671748a(23) =2384304a(24) =3261172a(25) =2384304a(26) =1671748a(27) =667200a(28) =2977440a(29) =8669484

External references