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 A224410 #8 Aug 30 2018 22:40:10 %S A224410 8,36,100,228,465,879,1568,2668,4362,6890,10560,15760,22971,32781, %T A224410 45900,63176,85612,114384,150860,196620,253477,323499,409032,512724, %U A224410 637550,786838,964296,1174040,1420623,1709065,2044884,2434128,2883408,3399932 %N A224410 Number of 3 X n 0..1 arrays with rows unimodal and antidiagonals nondecreasing. %C A224410 Row 3 of A224409. %H A224410 R. H. Hardin, <a href="/A224410/b224410.txt">Table of n, a(n) for n = 1..210</a> %F A224410 Empirical: a(n) = (1/720)*n^6 + (1/48)*n^5 + (29/144)*n^4 + (13/16)*n^3 + (2087/360)*n^2 + (7/6)*n. %F A224410 Conjectures from _Colin Barker_, Aug 30 2018: (Start) %F A224410 G.f.: x*(8 - 20*x + 16*x^2 + 4*x^3 - 11*x^4 + 4*x^5) / (1 - x)^7. %F A224410 a(n) = 7*a(n-1) - 21*a(n-2) + 35*a(n-3) - 35*a(n-4) + 21*a(n-5) - 7*a(n-6) + a(n-7) for n>7. %F A224410 (End) %e A224410 Some solutions for n=3: %e A224410 ..0..1..0....1..0..0....1..0..0....1..1..0....1..1..0....1..1..0....0..1..1 %e A224410 ..1..1..0....0..1..0....1..1..0....1..0..0....1..0..0....1..1..0....1..1..1 %e A224410 ..1..0..0....1..0..0....1..1..1....0..0..0....1..1..0....1..1..0....1..1..0 %Y A224410 Cf. A224409. %K A224410 nonn %O A224410 1,1 %A A224410 _R. H. Hardin_, Apr 05 2013