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 A236803 #6 Jul 23 2025 09:34:09 %S A236803 277,1435,8825,60187,410305,2926867,20377961,147734251,1039350577, %T A236803 7613312515,53944065785,398046992347,2834584305025,21024264295027, %U A236803 150246189753161,1118382878221771,8011732148951377,59783309384192995 %N A236803 Number of (n+1)X(2+1) 0..2 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock equal. %C A236803 Column 2 of A236809 %H A236803 R. H. Hardin, <a href="/A236803/b236803.txt">Table of n, a(n) for n = 1..210</a> %F A236803 Empirical: a(n) = 12*a(n-1) +15*a(n-2) -672*a(n-3) +2434*a(n-4) +864*a(n-5) -17988*a(n-6) +24192*a(n-7) +14472*a(n-8) -46656*a(n-9) +23328*a(n-10) %e A236803 Some solutions for n=4 %e A236803 ..2..1..1....1..2..1....1..0..1....2..1..2....1..2..1....1..2..0....0..1..2 %e A236803 ..2..0..1....2..0..2....0..0..0....2..2..2....0..2..2....2..2..1....1..1..1 %e A236803 ..1..2..0....2..1..2....0..1..2....0..1..0....0..1..0....2..1..1....2..1..2 %e A236803 ..1..1..0....0..2..0....2..0..0....1..1..1....2..0..2....0..0..1....0..2..0 %e A236803 ..1..2..0....1..0..1....0..1..0....1..0..1....0..1..2....1..0..2....2..1..2 %K A236803 nonn %O A236803 1,1 %A A236803 _R. H. Hardin_, Jan 31 2014