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

A233792

T(n,k)=Number of (n+1)X(k+1) 0..3 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) =48a(1) =188a(2) =188a(3) =720a(4) =864a(5) =720a(6) =2856a(7) =3932a(8) =3932a(9) =2856a(10) =11040a(11) =19396a(12) =20816a(13) =19396a(14) =11040a(15) =43888a(16) =93100a(17) =125976a(18) =125976a(19) =93100a(20) =43888a(21) =169920a(22) =479628a(23) =716768a(24) =966892a(25) =716768a(26) =479628a(27) =169920a(28) =675744a(29) =2368972

External references