T(n,k)=Number of (n+1)X(k+1) 0..3 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.
A233691
T(n,k)=Number of (n+1)X(k+1) 0..3 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) =32a(1) =108a(2) =108a(3) =356a(4) =548a(5) =356a(6) =1188a(7) =2628a(8) =2628a(9) =1188a(10) =3940a(11) =13324a(12) =19248a(13) =13324a(14) =3940a(15) =13108a(16) =64756a(17) =145512a(18) =145512a(19) =64756a(20) =13108a(21) =43540a(22) =327588a(23) =1095164a(24) =1723204a(25) =1095164a(26) =327588a(27) =43540a(28) =144740a(29) =1596200
External references
- oeis: A233691