|
%I #5 Mar 31 2012 12:36:06
%S 30976,4615296,394724320,39825200832,3861027028096,380882328583712,
%T 37393297725524928,3676830716968217056,361403949822499656288,
%U 35524816137109522769760,3492117188458641402526656
%N Number of (n+1)X5 0..3 arrays with every 2X2 subblock trace equal to exactly one or two horizontal and vertical neighbor 2X2 subblock traces
%C Column 4 of A186923
%H R. H. Hardin, <a href="/A186918/b186918.txt">Table of n, a(n) for n = 1..48</a>
%e Some solutions for 3X5
%e ..0..0..3..0..1....2..2..1..2..2....0..2..1..2..2....0..1..3..3..2
%e ..2..0..0..0..3....2..2..1..2..0....2..2..1..2..1....2..2..1..3..3
%e ..0..0..2..2..2....0..2..2..1..0....0..0..0..3..2....0..2..2..3..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 28 2011
| 