Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #5 Mar 31 2012 12:37:30
%S 24,175,175,1241,2710,1241,8876,40600,40600,8876,63280,614935,1277340,
%T 614935,63280,451762,9278940,40731729,40731729,9278940,451762,3223192,
%U 140274002,1293734407,2744311427,1293734407,140274002,3223192,23003132
%N T(n,k)=1/4 the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having distinct clockwise edge differences
%C Table starts
%C .......24.........175...........1241..............8876................63280
%C ......175........2710..........40600............614935..............9278940
%C .....1241.......40600........1277340..........40731729...........1293734407
%C .....8876......614935.......40731729........2744311427.........183988612894
%C ....63280.....9278940.....1293734407......183988612894.......26024000948100
%C ...451762...140274002....41170011836....12365282426546.....3690894707522275
%C ..3223192..2118517533..1308905451923...830023337140244...522757733883587522
%C .23003132.32012611741.41634764453267.55752055566749390.74095286689410395475
%H R. H. Hardin, <a href="/A209716/b209716.txt">Table of n, a(n) for n = 1..144</a>
%e Some solutions for n=4 k=3
%e ..1..0..3..2....0..0..1..0....0..1..0..3....3..2..2..0....1..0..0..0
%e ..3..2..3..0....1..3..3..3....2..3..1..0....1..3..0..3....0..3..1..3
%e ..0..2..0..1....0..0..1..0....0..3..0..3....0..1..3..1....1..0..1..0
%e ..2..3..1..3....2..3..1..3....0..1..0..1....1..3..0..3....1..3..3..1
%e ..2..0..3..2....0..3..0..3....3..3..3..1....1..0..1..1....1..0..1..2
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Mar 11 2012