login
Number of nX4 0..1 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other
1

%I #5 Mar 31 2012 12:36:57

%S 2,6,52,154,3824,34648,103690,3172388,30964178,98045292,3119147226,

%T 31498645552,102942841550,3339440847942,34385625760552,

%U 114418767377664,3757962051630128,39182005442010990,131941830464243716

%N Number of nX4 0..1 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other

%C Column 4 of A203638

%H R. H. Hardin, <a href="/A203634/b203634.txt">Table of n, a(n) for n = 1..48</a>

%e Some solutions for n=5

%e ..0..0..0..0....0..1..1..1....1..1..1..0....0..1..0..1....0..0..1..1

%e ..0..0..1..0....0..1..1..1....1..1..1..1....0..0..0..1....0..0..1..1

%e ..0..0..1..0....0..0..0..1....0..1..0..1....0..0..0..1....0..0..0..0

%e ..1..1..1..1....0..0..0..1....0..0..0..1....0..1..1..1....1..0..1..1

%e ..0..1..1..1....0..1..0..1....0..0..0..0....1..1..1..1....1..1..1..1

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 04 2012