T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 30 (30 maximizes T(1,1)), and no two adjacent values equal.
A233892
T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 30 (30 maximizes T(1,1)), and no two adjacent values equal.
Terms
- a(0) =112a(1) =384a(2) =384a(3) =1264a(4) =1960a(5) =1264a(6) =4292a(7) =9376a(8) =9376a(9) =4292a(10) =14272a(11) =47732a(12) =65280a(13) =47732a(14) =14272a(15) =48300a(16) =233468a(17) =496200a(18) =496200a(19) =233468a(20) =48300a(21) =161168a(22) =1183328a(23) =3580624a(24) =5859504a(25) =3580624a(26) =1183328a(27) =161168a(28) =544460a(29) =5829956
External references
- oeis: A233892