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 A251071 #6 Jun 02 2025 10:18:32 %S A251071 3935721,634161915,44280784440,1731036678270,44184817939580, %T A251071 813777827212550,11583623256480548,133881601767192816, %U A251071 1303359284227317194,10991187869604621942,82068339562605570512 %N A251071 Number of (7+1)X(n+1) 0..2 arrays with no 2X2 subblock having x11-x00 less than x10-x01. %C A251071 Row 7 of A251065 %H A251071 R. H. Hardin, <a href="/A251071/b251071.txt">Table of n, a(n) for n = 1..84</a> %e A251071 Some solutions for n=1 %e A251071 ..0..0....0..0....0..0....0..0....0..0....0..0....0..0....0..0....0..0....0..0 %e A251071 ..0..0....0..0....0..0....0..0....0..0....0..0....0..0....0..0....0..0....0..0 %e A251071 ..2..2....1..1....1..1....0..1....2..2....1..2....0..2....2..2....2..2....0..0 %e A251071 ..0..1....0..2....1..1....0..1....0..2....2..2....1..2....1..1....0..0....0..2 %e A251071 ..2..2....0..0....0..1....1..2....0..1....0..2....1..2....1..2....1..2....0..2 %e A251071 ..0..2....1..1....1..2....0..1....1..2....1..1....1..0....0..0....1..1....0..1 %e A251071 ..0..0....1..2....0..0....0..1....1..1....0..0....0..1....0..2....0..1....0..1 %e A251071 ..2..2....1..1....0..1....0..2....0..1....0..2....2..1....2..2....2..1....1..1 %K A251071 nonn %O A251071 1,1 %A A251071 _R. H. Hardin_, Nov 29 2014