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 A267716 #4 Jan 19 2016 20:15:06 %S A267716 12,144,546,1915,4444,10489,20226,39485,68430,119560,192852,313293, %T A267716 479670,740131,1089072,1617072,2306226,3323353,4621390,6500801, %U A267716 8852780,12205815,16330614,22134297,29166650,38947360,50640656,66733431,85743710 %N A267716 Number of nX5 0..1 arrays with every repeated value in every row and column greater than the previous repeated value. %C A267716 Column 5 of A267719. %H A267716 R. H. Hardin, <a href="/A267716/b267716.txt">Table of n, a(n) for n = 1..210</a> %F A267716 Empirical: a(n) = 2*a(n-1) +8*a(n-2) -18*a(n-3) -27*a(n-4) +72*a(n-5) +48*a(n-6) -168*a(n-7) -42*a(n-8) +252*a(n-9) -252*a(n-11) +42*a(n-12) +168*a(n-13) -48*a(n-14) -72*a(n-15) +27*a(n-16) +18*a(n-17) -8*a(n-18) -2*a(n-19) +a(n-20) for n>22 %e A267716 Some solutions for n=5 %e A267716 ..1..0..1..0..1....0..1..1..0..1....0..1..0..1..0....1..1..0..1..0 %e A267716 ..0..1..0..1..0....1..0..0..1..1....0..0..1..0..1....1..0..1..0..1 %e A267716 ..1..0..1..0..1....1..0..1..0..0....1..0..1..1..0....0..1..0..1..0 %e A267716 ..0..1..0..1..1....0..1..0..0..1....0..1..0..0..1....1..0..0..1..1 %e A267716 ..1..0..1..0..0....1..0..1..1..0....1..0..1..1..0....0..1..1..0..1 %Y A267716 Cf. A267719. %K A267716 nonn %O A267716 1,1 %A A267716 _R. H. Hardin_, Jan 19 2016