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 A200784 #13 Oct 15 2017 20:26:29 %S A200784 456,3270,23136,164004,1160616,8216484,58154912,411637168,2913595712, %T A200784 20622837480,145970677056,1033197881712,7313093248992,51762926098992, %U A200784 366383987227392,2593308396911680,18355737644921600,129924040926296800 %N A200784 Number of 0..7 arrays x(0..n+1) of n+2 elements without any two consecutive increases. %C A200784 Column 7 of A200785. %H A200784 R. H. Hardin, <a href="/A200784/b200784.txt">Table of n, a(n) for n = 1..210</a> %H A200784 A. Burstein and T. Mansour, <a href="http://arXiv.org/abs/math.CO/0112281">Words restricted by 3-letter generalized multipermutation patterns</a>, Annals. Combin., 7 (2003), 1-14. See Th. 3.13. %F A200784 Empirical: a(n) = 8*a(n-1) -56*a(n-3) +70*a(n-4) -28*a(n-6) +8*a(n-7). %F A200784 Empirical g.f.: 2*x*(228 - 189*x - 1512*x^2 + 2226*x^3 - 108*x^4 - 864*x^5 + 256*x^6) / ((1 - 2*x)*(1 + 2*x - 2*x^2)*(1 - 8*x + 6*x^2 + 4*x^3 - 2*x^4)). - _Colin Barker_, Oct 15 2017 %e A200784 Some solutions for n=3 %e A200784 ..7....5....7....4....5....2....3....7....5....5....5....6....1....5....4....4 %e A200784 ..0....5....4....2....3....2....1....4....0....5....7....4....0....5....4....4 %e A200784 ..0....5....4....1....6....6....3....5....0....4....6....6....6....7....4....4 %e A200784 ..0....1....7....1....5....5....0....0....6....1....6....3....0....0....4....7 %e A200784 ..1....4....0....6....5....2....6....5....3....4....2....4....1....2....4....3 %K A200784 nonn %O A200784 1,1 %A A200784 _R. H. Hardin_, Nov 22 2011