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 A266936 #9 Jan 10 2019 10:23:46 %S A266936 4,7,9,12,14,19,21,26,30,35,39,46,50,57,63,70,76,85,91,100,108,117, %T A266936 125,136,144,155,165,176,186,199,209,222,234,247,259,274,286,301,315, %U A266936 330,344,361,375,392,408,425,441,460,476,495,513,532,550,571,589,610,630,651,671 %N A266936 Number of 3 X n binary arrays with rows lexicographically nondecreasing and columns lexicographically nondecreasing and row sums nondecreasing and column sums nonincreasing. %H A266936 R. H. Hardin, <a href="/A266936/b266936.txt">Table of n, a(n) for n = 1..158</a> %F A266936 Empirical: a(n) = a(n-1) + a(n-2) - a(n-4) - a(n-5) + a(n-6). %F A266936 Empirical g.f.: x*(4 + 3*x - 2*x^2 - 4*x^3 - 3*x^4 + 4*x^5) / ((1 - x)^3*(1 + x)*(1 + x + x^2)). - _Colin Barker_, Jan 10 2019 %e A266936 Some solutions for n=4: %e A266936 ..0..0..0..1....0..0..1..1....1..1..1..1....0..0..1..1....0..0..1..1 %e A266936 ..1..1..1..0....1..1..0..1....1..1..1..1....1..1..0..0....1..1..0..0 %e A266936 ..1..1..1..0....1..1..1..0....1..1..1..1....1..1..0..0....1..1..1..1 %Y A266936 Row 3 of A266935. %K A266936 nonn %O A266936 1,1 %A A266936 _R. H. Hardin_, Jan 06 2016