Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Jan 18 2014 13:08:06
%S 17464,389520,8623452,199639388,4771399876,118118574840,3024782577128,
%T 79996751200984,2178566815760276,60872444688621924,
%U 1738300532840898816,50539524613860237520,1490870446811399175936,44489624599894762408316
%N Number of (n+1)X(4+1) 0..3 arrays with the minimum plus the maximum equal to the lower median plus the upper median in every 2X2 subblock
%C Column 4 of A236009
%H R. H. Hardin, <a href="/A236006/b236006.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=1
%e ..2..1..1..1..2....3..3..0..1..2....2..2..1..2..1....3..2..2..1..0
%e ..3..0..2..2..3....1..1..2..3..0....2..2..1..2..3....2..1..1..0..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 18 2014