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 #8 Feb 07 2014 19:18:03
%S 21456,238640,2671962,35476776,480758688,6045609040,74740595664,
%T 958854072908,12448856412422,158549359318752,2007141088266072,
%U 25632018579342668,328941744848836330,4196826763296220744
%N Number of (n+1) X (5+1) 0..2 arrays with the maximum plus the upper median plus the minimum of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.
%C Column 5 of A237412.
%H R. H. Hardin, <a href="/A237409/b237409.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=1
%e ..1..1..1..1..1..1....2..1..0..2..1..1....0..2..2..1..0..2....1..0..2..2..0..0
%e ..2..1..1..0..2..1....0..2..0..0..0..1....2..1..1..1..2..2....2..1..2..1..2..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 07 2014