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 A223681 #8 Aug 22 2018 06:25:17 %S A223681 8,64,316,1118,3177,7745,16857,33615,62518,109838,184042,296260, %T A223681 460799,695703,1023359,1471149,2072148,2865868,3899048,5226490, %U A223681 6911941,9029021,11662197,14907803,18875106,23687418,29483254,36417536,44662843,54410707 %N A223681 Number of 3 X n 0..1 arrays with rows and antidiagonals unimodal. %C A223681 Row 3 of A223680. %H A223681 R. H. Hardin, <a href="/A223681/b223681.txt">Table of n, a(n) for n = 1..210</a> %F A223681 Empirical: a(n) = (23/360)*n^6 + (31/120)*n^5 + (17/9)*n^4 + (23/24)*n^3 + (917/360)*n^2 + (77/60)*n + 1. %F A223681 Conjectures from _Colin Barker_, Aug 22 2018: (Start) %F A223681 G.f.: x*(8 + 8*x + 36*x^2 - 30*x^3 + 27*x^4 - 4*x^5 + x^6) / (1 - x)^7. %F A223681 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 A223681 (End) %e A223681 Some solutions for n=3: %e A223681 ..1..1..1....0..0..0....0..0..0....1..1..0....1..0..0....1..1..0....0..1..1 %e A223681 ..0..1..0....0..1..0....0..1..1....0..0..1....0..1..0....0..1..0....1..1..0 %e A223681 ..0..0..0....1..1..1....0..1..1....1..0..0....0..1..1....1..1..0....0..0..0 %Y A223681 Cf. A223680. %K A223681 nonn %O A223681 1,1 %A A223681 _R. H. Hardin_, Mar 25 2013