cp's OEIS Frontend

A236802 Number of (n+1) X (1+1) 0..2 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2 X 2 subblock equal.

%I A236802 #13 Feb 25 2018 08:41:48
%S A236802 81,277,1033,4183,17481,75907,330433,1468723,6479721,29026267,
%T A236802 128645233,577868563,2565424761,11535912427,51246733633,230538193603,
%U A236802 1024408886601,4609215271387,20483612959633,92170773169843,409632127625241
%N A236802 Number of (n+1) X (1+1) 0..2 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2 X 2 subblock equal.
%C A236802 Column 1 of A236809.
%H A236802 R. H. Hardin, <a href="/A236802/b236802.txt">Table of n, a(n) for n = 1..210</a>
%F A236802 Empirical: a(n) = 5*a(n-1) + 20*a(n-2) - 130*a(n-3) + 36*a(n-4) + 600*a(n-5) - 720*a(n-6).
%F A236802 Empirical g.f.: x*(81 - 128*x - 1972*x^2 + 4008*x^3 + 9000*x^4 - 19440*x^5) / ((1 - 2*x)*(1 - 3*x)*(1 - 6*x^2)*(1 - 20*x^2)). - _Colin Barker_, Feb 24 2018
%e A236802 Some solutions for n=5:
%e A236802   1 2    1 2    0 2    0 2    0 2    0 0    0 2    1 1    2 2    2 1
%e A236802   0 0    2 0    1 0    2 1    1 0    0 0    1 1    1 0    2 1    2 2
%e A236802   0 1    1 0    2 0    2 0    2 0    1 1    2 0    1 1    1 1    2 1
%e A236802   1 1    0 0    0 1    1 2    2 1    1 1    1 1    2 1    2 1    2 0
%e A236802   1 2    1 0    2 2    0 2    0 0    2 2    0 2    0 0    2 0    0 1
%e A236802   1 1    0 0    1 0    0 1    2 1    1 1    1 1    0 1    0 1    0 0
%Y A236802 Cf. A236809.
%K A236802 nonn
%O A236802 1,1
%A A236802 _R. H. Hardin_, Jan 31 2014