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 A254161 #6 Jul 23 2025 14:28:44 %S A254161 512,3036,16240,76832,348032,1511152,6440848,27128324,113712184, %T A254161 475820928,1990141264,8325715216,34837433912,145798977252, %U A254161 610246788472,2554332033248,10691962218368,44754714079088,187335498849168 %N A254161 Number of (n+2)X(1+2) 0..1 arrays with every 3X3 subblock diagonal maximum minus antidiagonal median nondecreasing horizontally, vertically and ne-to-sw antidiagonally. %C A254161 Column 1 of A254168 %H A254161 R. H. Hardin, <a href="/A254161/b254161.txt">Table of n, a(n) for n = 1..210</a> %F A254161 Empirical: a(n) = 8*a(n-1) -15*a(n-2) -25*a(n-3) +102*a(n-4) -5*a(n-5) -350*a(n-6) +624*a(n-7) -426*a(n-8) -760*a(n-9) +2636*a(n-10) -2924*a(n-11) +443*a(n-12) +3356*a(n-13) -5991*a(n-14) +4955*a(n-15) -658*a(n-16) -3981*a(n-17) +5832*a(n-18) -4144*a(n-19) +1408*a(n-20) +1110*a(n-21) -2260*a(n-22) +1682*a(n-23) -1044*a(n-24) +360*a(n-25) +132*a(n-26) -168*a(n-27) +192*a(n-28) -88*a(n-29) +16*a(n-30) -16*a(n-32) %e A254161 Some solutions for n=4 %e A254161 ..1..1..1....1..1..1....1..0..1....0..0..1....1..0..1....0..0..1....1..1..1 %e A254161 ..0..1..1....0..1..0....0..1..0....1..1..1....1..1..1....1..0..1....1..0..1 %e A254161 ..1..1..1....1..0..0....0..1..0....0..1..1....0..0..1....1..0..1....0..0..0 %e A254161 ..1..0..1....1..1..1....0..1..0....1..1..1....1..1..0....1..1..0....0..1..0 %e A254161 ..0..0..0....0..0..0....0..0..1....0..1..1....1..0..0....0..1..1....0..1..1 %e A254161 ..0..1..1....0..0..1....1..0..1....1..1..0....0..0..0....1..0..1....0..1..1 %K A254161 nonn %O A254161 1,1 %A A254161 _R. H. Hardin_, Jan 26 2015