The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #4 Feb 08 2014 06:12:56
%S 603184,27861088,1299276552,65361132006,3172303208646,151684392243456,
%T 7302593738902292,360243701062474580,17487444406970424454,
%U 842931592169286911228,40843411425839816108458,1996250937306560360967496
%N Number of (n+1)X(7+1) 0..2 arrays with the maximum plus the lower median minus the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one
%C Column 7 of A237472
%H R. H. Hardin, <a href="/A237471/b237471.txt">Table of n, a(n) for n = 1..59</a>
%e Some solutions for n=1
%e ..0..2..1..1..0..0..1..0....0..0..0..0..1..0..2..2....0..0..1..1..2..1..1..0
%e ..1..0..1..1..0..1..2..0....1..1..2..2..2..1..2..2....1..0..1..0..1..2..1..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 08 2014