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 13 2014 06:31:33
%S 12328,240288,4723728,93725888,1860456346,36979544756,734099743522,
%T 14562769631776,289281162344418,5749494298260124,114138381618370062,
%U 2264233354234167848,44977990404130830846,893941548946005938016
%N Number of (n+1)X(3+1) 0..3 arrays with the maximum plus the upper median plus the minimum minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one
%C Column 3 of A237785
%H R. H. Hardin, <a href="/A237782/b237782.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=1
%e ..2..0..2..2....3..0..2..0....3..0..0..0....1..2..0..3....2..2..3..1
%e ..1..1..0..0....0..2..0..1....2..3..0..2....2..3..0..3....1..0..3..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 13 2014