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 A251805 #6 Jun 02 2025 10:32:45 %S A251805 2430631,474547100,44356434596,2446811684440,90717637876583, %T A251805 2466029519190492,52256028323545001,902865704126649438, %U A251805 13158989979297456736,166106632087042847162,1854323843850427384132 %N A251805 Number of (5+1)X(n+1) 0..3 arrays with no 2X2 subblock having x11-x00 less than x10-x01. %C A251805 Row 5 of A251801 %H A251805 R. H. Hardin, <a href="/A251805/b251805.txt">Table of n, a(n) for n = 1..115</a> %e A251805 Some solutions for n=1 %e A251805 ..0..2....0..0....0..2....0..0....0..2....0..2....0..0....0..0....0..0....0..2 %e A251805 ..0..2....2..2....0..2....0..2....0..2....0..2....0..2....0..2....0..0....0..0 %e A251805 ..2..3....0..2....0..1....1..2....0..0....0..1....2..1....0..2....2..2....1..1 %e A251805 ..2..3....1..3....3..2....3..2....1..3....1..2....0..2....2..1....2..3....0..2 %e A251805 ..1..0....3..2....0..1....0..3....1..2....1..2....0..3....0..1....0..2....0..1 %e A251805 ..1..3....2..3....0..3....2..0....3..2....3..2....0..3....0..0....2..0....3..2 %K A251805 nonn %O A251805 1,1 %A A251805 _R. H. Hardin_, Dec 09 2014