login
Number of nX5 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 8,26,236,3824,58816,951900,16080792,278135578,4911608328,88014442794,

%T 1595784960340,29207585540256,538759416109136,10003103446747306,

%U 186764193731244404,3503820046529733422,66010275892736979884

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

%C Column 5 of A203638

%H R. H. Hardin, <a href="/A203635/b203635.txt">Table of n, a(n) for n = 1..28</a>

%e Some solutions for n=5

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 04 2012