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 09 2014 05:59:55
%S 14208,344128,8541016,211030720,5218152940,129193956304,3195177788984,
%T 78931540544960,1951895042417328,48324177095813136,
%U 1195132652547216824,29524023998686535104,730098726361131592076,18075474037400468918624
%N Number of (n+1)X(3+1) 0..3 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one
%C Column 3 of A237544
%H R. H. Hardin, <a href="/A237541/b237541.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=1
%e ..2..1..3..2....1..3..1..0....0..0..2..2....1..3..1..0....3..3..0..3
%e ..1..3..3..1....0..3..3..1....3..1..0..0....2..2..3..2....2..3..2..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 09 2014