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 17 2014 10:54:23
%S 1910,26634,373572,5318512,75397960,1065216948,15062600632,
%T 213664795084,3026358430964,42818955192388,606190597854048,
%U 8588163214676008,121611558126976150,1721588383113148144,24377472762713256254
%N Number of (n+1)X(2+1) 0..3 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 2 of A238063
%H R. H. Hardin, <a href="/A238059/b238059.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=2
%e ..3..2..2....2..1..1....0..1..3....1..3..2....0..1..2....1..0..1....2..0..0
%e ..0..1..3....0..0..0....2..0..2....0..2..0....2..3..2....0..2..1....2..3..1
%e ..0..0..2....2..2..1....2..0..3....1..0..0....3..3..0....2..0..2....1..3..3
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 17 2014