login
Number of nX1 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,4,4,2,8,12,6,32,56,32,160,270,150,840,1512,882,4704,8232,4704,

%T 26880,48960,28800,158400,282150,163350,943800,1730300,1022450,

%U 5725720,10306296,6012006,34978944,64393056,38158848,216233472,391923168

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

%C Column 1 of A203638

%H R. H. Hardin, <a href="/A203631/b203631.txt">Table of n, a(n) for n = 1..625</a>

%e All solutions for n=5

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 04 2012