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 A267784 #4 Jan 20 2016 12:28:19 %S A267784 15,225,1056,5081,14956,44742,102954,238813,472174,935890,1669256, %T A267784 2973801,4921484,8116406,12686802,19733869,29485150,43804354,63094592, %U A267784 90326137,126206748,175240166,238647082,322974141,430276638,569730226 %N A267784 Number of nX4 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 A267784 Column 4 of A267788. %H A267784 R. H. Hardin, <a href="/A267784/b267784.txt">Table of n, a(n) for n = 1..210</a> %F A267784 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 A267784 Some solutions for n=4 %e A267784 ..0..1..1..0....0..0..0..0....1..0..0..0....0..1..1..0....1..1..0..1 %e A267784 ..1..0..0..1....0..0..1..0....0..1..1..1....1..0..0..1....0..0..0..0 %e A267784 ..0..1..1..1....1..1..0..1....1..1..1..0....0..0..1..0....0..1..1..1 %e A267784 ..1..0..1..0....1..1..1..1....0..0..0..0....0..1..1..1....1..1..1..1 %Y A267784 Cf. A267788. %K A267784 nonn %O A267784 1,1 %A A267784 _R. H. Hardin_, Jan 20 2016