Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Dec 18 2015 18:17:58
%S 3,16,172,20000,8227090
%N Number of n X n 0..2 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other
%C Diagonal of A203600
%e Some solutions for n=4
%e ..2..1..0..2....1..0..2..0....1..0..0..2....1..2..2..0....0..0..1..1
%e ..0..0..2..2....0..0..1..0....1..0..1..2....0..2..2..0....0..1..2..0
%e ..0..0..1..2....0..2..2..1....0..0..2..1....0..1..0..0....0..2..2..0
%e ..1..0..2..2....0..2..2..2....0..2..2..2....2..2..1..0....1..2..2..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 03 2012