|
%I #5 Mar 31 2012 12:37:28
%S 128,410,840,4004,8648,52784,114056,790712,1693448,12487208,26563080,
%T 201742280,427484168,3292956296,6963468296,54006743816,114088980488,
%U 887752094216,1874426109960,14608478297096,30837161410568
%N 1/4 the number of (n+1)X7 0..2 arrays with every 2X2 subblock having distinct edge sums
%C Column 6 of A209382
%H R. H. Hardin, <a href="/A209380/b209380.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = a(n-1) +38*a(n-2) -38*a(n-3) -516*a(n-4) +516*a(n-5) +3144*a(n-6) -3144*a(n-7) -8480*a(n-8) +8480*a(n-9) +7936*a(n-10) -7936*a(n-11)
%e Some solutions for n=4
%e ..2..0..0..1..0..0..2....0..1..0..2..2..2..2....2..2..0..2..2..1..2
%e ..2..1..2..2..2..1..2....2..2..0..1..0..1..0....0..1..0..1..0..0..2
%e ..2..0..0..1..0..0..0....0..1..0..2..2..2..2....2..2..0..2..2..1..2
%e ..2..1..2..2..2..1..2....0..2..0..1..0..1..0....0..1..0..1..0..0..2
%e ..0..0..0..1..0..0..2....0..1..0..2..2..2..2....2..2..2..2..2..1..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 07 2012
| 