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 A223633 #8 Aug 22 2018 02:01:59 %S A223633 11,121,801,3712,13599,42109,114713,282273,639165,1350228,2689169, %T A223633 5091414,9224755,16081503,27096217,44293439,70470225,109418622, %U A223633 166193601,247432316,361730919,520085521,736404249,1028097709,1416755525 %N A223633 Number of n X 4 0..1 arrays with rows, antidiagonals and columns unimodal. %C A223633 Column 4 of A223637. %H A223633 R. H. Hardin, <a href="/A223633/b223633.txt">Table of n, a(n) for n = 1..210</a> %F A223633 Empirical: a(n) = (1/112)*n^8 - (1/72)*n^7 + (203/360)*n^6 + (37/360)*n^5 + (41/144)*n^4 + (901/36)*n^3 - (168481/2520)*n^2 + (5693/60)*n - 45 for n>2. %F A223633 Conjectures from _Colin Barker_, Aug 21 2018: (Start) %F A223633 G.f.: x*(11 + 22*x + 108*x^2 - 65*x^3 + 249*x^4 - 74*x^5 + 92*x^6 + 18*x^7 + 9*x^8 - 11*x^9 + x^10) / (1 - x)^9. %F A223633 a(n) = 9*a(n-1) - 36*a(n-2) + 84*a(n-3) - 126*a(n-4) + 126*a(n-5) - 84*a(n-6) + 36*a(n-7) - 9*a(n-8) + a(n-9) for n>11. %F A223633 (End) %e A223633 Some solutions for n=4: %e A223633 ..0..0..1..0....0..1..1..0....1..0..0..0....0..0..0..1....0..1..0..0 %e A223633 ..0..1..1..1....0..1..1..0....1..0..0..0....0..1..1..0....0..1..1..0 %e A223633 ..1..1..1..1....0..1..1..0....1..1..0..0....1..1..1..0....0..0..0..1 %e A223633 ..1..0..0..0....1..1..1..1....0..1..1..0....0..1..0..0....0..0..0..1 %Y A223633 Cf. A223637. %K A223633 nonn %O A223633 1,1 %A A223633 _R. H. Hardin_, Mar 24 2013