|
%I #5 Mar 31 2012 12:36:57
%S 4,4,6,6,26,90,222,674,2158,6546,20382,63922,200946,639554,2037050,
%T 6507122,20923918,67445362,217924638,706488874,2295658074,7475460546,
%U 24394962306,79753388458,261182132074,856719190626,2814241452698
%N Number of nX2 0..1 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other
%C Column 2 of A203638
%H R. H. Hardin, <a href="/A203632/b203632.txt">Table of n, a(n) for n = 1..169</a>
%e Some solutions for n=5
%e ..1..1....1..0....0..1....1..1....1..0....1..1....0..0....1..1....0..0....1..1
%e ..1..0....0..0....0..0....1..1....1..1....0..1....0..0....1..1....1..0....1..1
%e ..1..1....0..0....0..0....0..0....1..1....0..1....1..1....0..0....1..0....0..0
%e ..0..0....1..1....1..1....0..0....0..0....0..1....0..1....0..0....1..0....0..1
%e ..0..0....1..1....1..1....1..0....0..0....0..0....1..1....0..1....1..1....0..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 04 2012
| 