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 A267715 #4 Jan 19 2016 20:14:22 %S A267715 9,81,270,872,1915,4266,7879,14632,24440,40816,63714,99260,147469, %T A267715 218666,312723,446708,619670,859376,1162558,1573616,2084223,2764010, %U A267715 3595063,4684320,5997316,7694800,9715586,12296260,15334641,19171946,23645587 %N A267715 Number of nX4 0..1 arrays with every repeated value in every row and column greater than the previous repeated value. %C A267715 Column 4 of A267719. %H A267715 R. H. Hardin, <a href="/A267715/b267715.txt">Table of n, a(n) for n = 1..210</a> %F A267715 Empirical: a(n) = 2*a(n-1) +6*a(n-2) -14*a(n-3) -14*a(n-4) +42*a(n-5) +14*a(n-6) -70*a(n-7) +70*a(n-9) -14*a(n-10) -42*a(n-11) +14*a(n-12) +14*a(n-13) -6*a(n-14) -2*a(n-15) +a(n-16) for n>18 %e A267715 Some solutions for n=5 %e A267715 ..0..1..0..1....0..0..1..0....1..0..1..1....0..1..1..0....0..1..0..0 %e A267715 ..1..0..1..0....0..1..0..0....0..1..1..0....1..0..0..1....1..0..1..0 %e A267715 ..1..0..1..0....1..1..0..1....1..1..0..1....0..0..1..1....0..0..1..1 %e A267715 ..0..1..0..1....1..0..1..0....0..0..1..0....0..1..1..0....1..1..0..1 %e A267715 ..1..0..1..1....0..1..0..1....0..1..0..0....1..0..0..1....1..0..1..0 %Y A267715 Cf. A267719. %K A267715 nonn %O A267715 1,1 %A A267715 _R. H. Hardin_, Jan 19 2016