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 A267791 #4 Jan 20 2016 12:33:54 %S A267791 12,144,1728,14956,122770,912667,6484282,44116906,291598056, %T A267791 1881990170,11929079568,74523706754,460243376586,2816128573885, %U A267791 17102667014556,103235741899301,620066832024346,3709209084709809,22114443898367338 %N A267791 Number of 5Xn 0..1 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value. %C A267791 Row 5 of A267788. %H A267791 R. H. Hardin, <a href="/A267791/b267791.txt">Table of n, a(n) for n = 1..210</a> %e A267791 Some solutions for n=4 %e A267791 ..1..0..1..0....1..0..0..1....0..1..0..0....1..0..0..0....1..0..1..1 %e A267791 ..0..1..0..1....1..1..1..0....1..0..0..0....0..1..1..1....0..1..1..0 %e A267791 ..1..0..0..0....0..0..0..1....1..1..1..1....0..0..0..0....0..1..0..0 %e A267791 ..1..1..1..1....1..1..1..1....0..0..1..0....1..0..1..0....1..0..1..1 %e A267791 ..0..1..1..1....0..1..0..0....1..1..0..1....1..1..1..1....0..1..0..0 %Y A267791 Cf. A267788. %K A267791 nonn %O A267791 1,1 %A A267791 _R. H. Hardin_, Jan 20 2016