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:17
%S 136488,4259914,133796732,4493037466,146338935672,4700362341374,
%T 151684392243456,5007362962565092,162994330090508444,
%U 5271872217452225020,171132111320509026024,5603967873665490496034,182364827391880418673888
%N Number of (n+1)X(6+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 6 of A237472
%H R. H. Hardin, <a href="/A237470/b237470.txt">Table of n, a(n) for n = 1..177</a>
%e Some solutions for n=1
%e ..0..2..0..1..1..0..2....1..2..0..1..1..2..2....0..1..0..1..2..1..0
%e ..1..2..0..0..0..0..0....1..1..0..1..0..1..1....2..1..1..2..1..0..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 08 2014