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

A233967

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

Terms

    a(0) =48a(1) =188a(2) =188a(3) =728a(4) =864a(5) =728a(6) =3016a(7) =3976a(8) =3976a(9) =3016a(10) =12416a(11) =20564a(12) =21272a(13) =20564a(14) =12416a(15) =52880a(16) =106056a(17) =134044a(18) =134044a(19) =106056a(20) =52880a(21) =224288a(22) =587472a(23) =840136a(24) =1037788a(25) =840136a(26) =587472a(27) =224288a(28) =966496a(29) =3219000

External references