cp's OEIS Frontend

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

%I A236808 #6 Jul 23 2025 09:34:41
%S A236808 330433,20377961,1117775361,86863046591,5094225962785,457619414560859,
%T A236808 27385111938746265,2738509536172477067,163523882162586207553,
%U A236808 17866672312397065316531,1056619306386809386800201
%N A236808 Number of (n+1)X(7+1) 0..2 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock equal.
%C A236808 Column 7 of A236809
%H A236808 R. H. Hardin, <a href="/A236808/b236808.txt">Table of n, a(n) for n = 1..118</a>
%F A236808 Empirical: a(n) = 146*a(n-1) +8581*a(n-2) -2153126*a(n-3) +36986164*a(n-4) +8566608616*a(n-5) -403792107492*a(n-6) -4627004769288*a(n-7) +614603881718240*a(n-8) -11583617148991360*a(n-9) +50064271774317056*a(n-10) +362780843147264*a(n-11) -383746761879830528*a(n-12) +600909926643662848*a(n-13) +270740030729748480*a(n-14) -1110528281385369600*a(n-15) +583172068737024000*a(n-16)
%e A236808 Some solutions for n=1
%e A236808 ..1..0..2..0..1..2..0..2....1..0..2..2..0..0..1..1....1..0..2..1..0..2..1..1
%e A236808 ..2..2..1..2..0..2..1..0....1..1..0..1..2..1..1..0....1..1..2..2..2..1..1..0
%K A236808 nonn
%O A236808 1,1
%A A236808 _R. H. Hardin_, Jan 31 2014