T(n,k)=Number of (n+1)X(k+1) 0..7 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 59 (59 maximizes T(1,1)).
A233859
T(n,k)=Number of (n+1)X(k+1) 0..7 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 59 (59 maximizes T(1,1)).
Terms
- a(0) =216a(1) =1040a(2) =1040a(3) =4640a(4) =4824a(5) =4640a(6) =22592a(7) =22472a(8) =22472a(9) =22592a(10) =104576a(11) =129728a(12) =106304a(13) =129728a(14) =104576a(15) =511232a(16) =699984a(17) =716800a(18) =716800a(19) =699984a(20) =511232a(21) =2416128a(22) =4332592a(23) =4319616a(24) =5783176a(25) =4319616a(26) =4332592a(27) =2416128a(28) =11843584a(29) =24793848
External references
- oeis: A233859