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 12 2014 07:05:02
%S 28877,542946,10499035,213127880,4174594857,81322186248,1600427032562,
%T 31963255437824,628861098745518,12333769685662064,243325043577953816,
%U 4824543828151342532,95071620844450797674,1870327346910709693072
%N Number of (n+1)X(5+1) 0..2 arrays with the maximum plus the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one
%C Column 5 of A237730
%H R. H. Hardin, <a href="/A237727/b237727.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=1
%e ..0..1..2..1..2..1....0..0..0..2..1..1....1..1..2..2..1..0....2..1..1..2..1..1
%e ..1..2..0..1..2..2....0..2..1..1..2..1....1..2..0..0..2..1....0..0..0..0..1..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 12 2014