This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A236804 #6 Jul 23 2025 09:34:15 %S A236804 1033,8825,85929,929447,9558409,107087939,1117775361,12821027315, %T A236804 135199336873,1580326999835,16792477473969,199287485892947, %U A236804 2129881236360889,25583932979862059,274630528704260481 %N A236804 Number of (n+1)X(3+1) 0..2 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock equal. %C A236804 Column 3 of A236809 %H A236804 R. H. Hardin, <a href="/A236804/b236804.txt">Table of n, a(n) for n = 1..210</a> %F A236804 Empirical: a(n) = 24*a(n-1) -55*a(n-2) -2772*a(n-3) +26568*a(n-4) -71616*a(n-5) -74996*a(n-6) +644112*a(n-7) -762032*a(n-8) -588288*a(n-9) +1612416*a(n-10) -783360*a(n-11) %e A236804 Some solutions for n=3 %e A236804 ..2..2..1..1....0..0..0..2....0..1..2..1....2..0..1..0....2..1..2..2 %e A236804 ..2..1..1..0....0..1..0..1....0..2..2..0....1..0..2..0....0..2..2..1 %e A236804 ..1..1..0..0....0..0..2..0....1..0..1..2....1..1..0..1....1..2..1..1 %e A236804 ..1..0..0..1....2..1..0..1....0..2..0..2....1..2..2..0....1..1..1..0 %K A236804 nonn %O A236804 1,1 %A A236804 _R. H. Hardin_, Jan 31 2014