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 11 2014 09:41:43
%S 1564,14244,132572,1346420,13569422,134401476,1333046350,13340078386,
%T 133387449994,1328426151742,13234291152744,132112050245452,
%U 1318587054311498,13147462329089532,131102446354703274
%N Number of (n+1)X(2+1) 0..3 arrays with the maximum plus the upper median plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one
%C Column 2 of A237677
%H R. H. Hardin, <a href="/A237673/b237673.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=3
%e ..1..1..3....2..3..0....0..2..3....2..1..2....2..3..3....2..1..1....2..1..3
%e ..2..2..1....1..3..1....1..2..0....1..1..0....1..2..1....0..2..2....3..3..0
%e ..0..2..2....0..3..2....0..1..2....2..0..3....3..3..2....3..1..3....0..1..2
%e ..1..1..0....2..1..1....3..1..2....2..0..0....2..0..0....0..1..1....2..3..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 11 2014