Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #6 Mar 31 2012 12:37:30
%S 30,204,204,1380,3171,1380,9348,49056,49056,9348,63300,759642,1732554,
%T 759642,63300,428676,11761044,61289190,61289190,11761044,428676,
%U 2902980,182095128,2167312950,4953638163,2167312950,182095128,2902980,19659012
%N T(n,k)=Half the number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having exactly one duplicate clockwise edge difference
%C Table starts
%C .......30.........204...........1380...............9348.................63300
%C ......204........3171..........49056.............759642..............11761044
%C .....1380.......49056........1732554...........61289190............2167312950
%C .....9348......759642.......61289190.........4953638163..........400252237467
%C ....63300....11761044.....2167312950.......400252237467........73890766377408
%C ...428676...182095128....76648760118.....32342700329739.....13642480312938969
%C ..2902980..2819342124..2710658447034...2613436161921981...2518750352620857312
%C .19659012.43651363500.95862567834618.211178329470822063.465030007730370004089
%H R. H. Hardin, <a href="/A209796/b209796.txt">Table of n, a(n) for n = 1..264</a>
%e Some solutions for n=4 k=3
%e ..1..1..0..1....0..1..2..0....0..1..0..2....1..2..2..1....0..2..2..0
%e ..2..2..2..1....1..1..2..0....2..2..0..1....2..2..1..1....0..1..0..0
%e ..1..1..0..0....0..1..1..0....2..0..0..1....2..1..1..0....1..1..2..2
%e ..2..0..0..1....0..1..2..2....2..1..0..1....1..1..0..0....1..2..2..0
%e ..0..0..1..1....2..2..2..0....1..1..2..2....1..2..0..2....1..2..1..1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Mar 13 2012