cp's OEIS Frontend

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

%I A236806 #6 Jul 23 2025 09:34:28
%S A236806 17481,410305,9558409,270610375,6612746409,203606804707,5094225962785,
%T A236806 167431587932179,4238424064205001,146743496294875195,
%U A236806 3736375181313140689,134871797219330857075,3444806969589767397849,128484283442135059854667
%N A236806 Number of (n+1)X(5+1) 0..2 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock equal.
%C A236806 Column 5 of A236809
%H A236806 R. H. Hardin, <a href="/A236806/b236806.txt">Table of n, a(n) for n = 1..210</a>
%F A236806 Empirical: a(n) = 6*a(n-1) +2037*a(n-2) -12282*a(n-3) -1251404*a(n-4) +7631304*a(n-5) +222376028*a(n-6) -1410692088*a(n-7) +774758880*a(n-8) +9534803520*a(n-9) -17365107200*a(n-10) -5340748800*a(n-11) +29872128000*a(n-12) -16293888000*a(n-13)
%e A236806 Some solutions for n=1
%e A236806 ..0..2..2..1..0..1....2..2..1..2..2..2....1..1..2..2..2..2....2..0..1..1..2..2
%e A236806 ..0..1..2..2..2..0....1..2..0..0..1..2....1..0..0..1..2..1....0..1..1..0..2..1
%K A236806 nonn
%O A236806 1,1
%A A236806 _R. H. Hardin_, Jan 31 2014