T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10 (10 maximizes T(1,1)), and no two adjacent values equal.

A233958

T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10 (10 maximizes T(1,1)), and no two adjacent values equal.

Terms

    a(0) =80a(1) =380a(2) =380a(3) =1776a(4) =2820a(5) =1776a(6) =8336a(7) =20616a(8) =20616a(9) =8336a(10) =39084a(11) =152216a(12) =238800a(13) =152216a(14) =39084a(15) =183304a(16) =1120996a(17) =2805732a(18) =2805732a(19) =1120996a(20) =183304a(21) =859628a(22) =8268188a(23) =32938264a(24) =52918992a(25) =32938264a(26) =8268188a(27) =859628a(28) =4031428a(29) =60946532

External references