|
%I #5 Mar 31 2012 12:37:30
%S 34,258,258,1956,4975,1956,14832,95794,95794,14832,112464,1845126,
%T 4681176,1845126,112464,852768,35537484,228881560,228881560,35537484,
%U 852768,6466176,684469520,11189540644,28414622976,11189540644,684469520
%N T(n,k)=Half the number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having at most one duplicate clockwise edge difference
%C Table starts
%C .......34..........258.............1956...............14832
%C ......258.........4975............95794.............1845126
%C .....1956........95794..........4681176...........228881560
%C ....14832......1845126........228881560.........28414622976
%C ...112464.....35537484......11189540644.......3526904366260
%C ...852768....684469520.....547050257224.....437792367422004
%C ..6466176..13183187396...26744766723116...54342179402121844
%C .49030272.253914272972.1307528820052772.6745399989408922240
%H R. H. Hardin, <a href="/A209951/b209951.txt">Table of n, a(n) for n = 1..264</a>
%e Some solutions for n=4 k=3
%e ..2..0..1..2....1..0..0..0....0..0..2..0....1..2..1..1....0..0..2..1
%e ..2..1..1..1....0..2..2..1....0..2..2..2....1..1..1..0....2..0..1..1
%e ..1..1..2..2....0..0..2..0....1..1..0..2....1..2..1..2....0..0..2..0
%e ..2..2..0..1....0..2..1..2....2..0..2..1....0..2..2..2....2..2..1..1
%e ..0..2..2..1....1..1..1..1....1..2..1..1....2..1..0..1....2..1..1..2
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Mar 16 2012
| 