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 A267714 #4 Jan 19 2016 20:13:37 %S A267714 6,36,102,270,546,1080,1866,3186,5010,7830,11550,17004,23934,33726, %T A267714 45786,62364,82254,109008,140406,181890,229674,291852,362346,452862, %U A267714 554106,682578,824622,1002960,1198182,1440930,1704378,2029080,2378838,2806428 %N A267714 Number of nX3 0..1 arrays with every repeated value in every row and column greater than the previous repeated value. %C A267714 Column 3 of A267719. %H A267714 R. H. Hardin, <a href="/A267714/b267714.txt">Table of n, a(n) for n = 1..210</a> %F A267714 Empirical: a(n) = 2*a(n-1) +4*a(n-2) -10*a(n-3) -5*a(n-4) +20*a(n-5) -20*a(n-7) +5*a(n-8) +10*a(n-9) -4*a(n-10) -2*a(n-11) +a(n-12) %e A267714 Some solutions for n=5 %e A267714 ..0..1..1....0..1..1....0..0..1....1..1..0....1..0..0....1..0..0....1..0..0 %e A267714 ..1..0..0....1..0..0....0..1..0....0..0..1....1..0..1....0..1..1....0..1..1 %e A267714 ..0..1..1....1..1..0....1..0..1....0..1..0....0..1..1....1..0..0....1..0..1 %e A267714 ..1..0..1....0..0..1....0..1..1....1..0..1....1..1..0....0..1..0....0..1..0 %e A267714 ..0..1..0....1..1..0....1..1..0....1..1..0....0..0..1....0..0..1....0..1..1 %Y A267714 Cf. A267719. %K A267714 nonn %O A267714 1,1 %A A267714 _R. H. Hardin_, Jan 19 2016