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 A267732 #4 Jan 20 2016 07:05:23 %S A267732 28,784,21952,451278,9116396,163879101,2818160392,45839624169, %T A267732 718310821738,10874476927778,160107985766626,2300536065892988, %U A267732 32371741678239290,447233651315427782,6079896218958203376 %N A267732 Number of nX5 0..1 arrays with every repeated value in every row and column greater than or equal to the previous repeated value. %C A267732 Column 5 of A267735. %H A267732 R. H. Hardin, <a href="/A267732/b267732.txt">Table of n, a(n) for n = 1..210</a> %e A267732 Some solutions for n=3 %e A267732 ..0..0..1..1..1....0..0..1..1..0....0..0..0..1..0....1..0..0..0..0 %e A267732 ..1..0..0..0..0....1..0..1..0..0....1..0..0..0..0....1..1..1..1..1 %e A267732 ..0..0..0..0..1....1..0..0..1..1....0..1..1..1..0....1..0..0..0..1 %Y A267732 Cf. A267735. %K A267732 nonn %O A267732 1,1 %A A267732 _R. H. Hardin_, Jan 20 2016