|
%I #5 Mar 31 2012 12:37:30
%S 22,124,124,696,1096,696,3912,9712,9712,3912,21976,86744,137888,86744,
%T 21976,123480,775096,1995752,1995752,775096,123480,693752,6933120,
%U 28927984,47572464,28927984,6933120,693752,3897880,62007896,420545824
%N T(n,k)=1/4 the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having distinct edge sums
%C Table starts
%C ......22.......124.........696...........3912............21976
%C .....124......1096........9712..........86744...........775096
%C .....696......9712......137888........1995752.........28927984
%C ....3912.....86744.....1995752.......47572464.......1138541280
%C ...21976....775096....28927984.....1138541280......45147495264
%C ..123480...6933120...420545824....27425792944....1809791149768
%C ..693752..62007896..6111765608...660346502176...72515584004736
%C .3897880.554698328.88883321584.15926642688032.2914488537817408
%H R. H. Hardin, <a href="/A209736/b209736.txt">Table of n, a(n) for n = 1..144</a>
%e Some solutions for n=4 k=3
%e ..0..3..3..0....0..2..2..3....2..1..1..2....1..3..2..3....0..1..0..0
%e ..0..1..2..2....0..1..0..3....2..0..3..3....1..0..2..0....3..3..3..1
%e ..2..3..3..0....2..2..2..3....1..0..1..0....1..3..3..3....1..2..0..1
%e ..0..0..1..0....3..0..1..1....3..3..3..2....0..2..0..1....0..2..3..1
%e ..3..2..3..2....1..0..3..2....1..0..1..0....3..2..3..3....1..2..0..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Mar 12 2012
| 