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

A233903

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

Terms

    a(0) =144a(1) =656a(2) =656a(3) =2688a(4) =2944a(5) =2688a(6) =12288a(7) =12152a(8) =12152a(9) =12288a(10) =51200a(11) =62064a(12) =47232a(13) =62064a(14) =51200a(15) =233984a(16) =278416a(17) =267792a(18) =267792a(19) =278416a(20) =233984a(21) =987136a(22) =1521520a(23) =1194976a(24) =1795420a(25) =1194976a(26) =1521520a(27) =987136a(28) =4503552a(29) =7123728

External references