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

A233883

T(n,k)=Number of (n+1)X(k+1) 0..2 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) =24a(1) =76a(2) =76a(3) =240a(4) =300a(5) =240a(6) =760a(7) =1224a(8) =1224a(9) =760a(10) =2400a(11) =5156a(12) =6200a(13) =5156a(14) =2400a(15) =7600a(16) =22020a(17) =33656a(18) =33656a(19) =22020a(20) =7600a(21) =24000a(22) =95464a(23) =178704a(24) =251532a(25) =178704a(26) =95464a(27) =24000a(28) =76000a(29) =415092

External references