%I #6 Dec 18 2015 18:17:58
%S 2,4,8,154,58816,8752012,14513555724,259726000943352,
%T 1588377098739527452
%N Number of n X n 0..1 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other
%C Diagonal of A203638
%e Some solutions for n=5
%e ..1..1..1..0..0....1..1..0..1..1....1..0..0..1..1....0..1..1..0..0
%e ..1..1..0..0..0....1..1..1..1..1....1..0..1..1..1....1..1..1..0..0
%e ..0..1..0..0..1....0..0..0..1..1....1..1..1..1..0....1..1..1..0..1
%e ..1..1..0..0..1....1..0..0..0..0....1..0..0..0..0....0..1..0..0..1
%e ..1..1..0..0..1....0..0..0..0..1....0..0..0..0..0....0..0..0..0..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 04 2012
|