cp's OEIS Frontend

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.

A224408 Number of n X 7 0..1 arrays with rows unimodal and antidiagonals nondecreasing.

This page as a plain text file.
%I A224408 #7 Aug 30 2018 08:20:16
%S A224408 29,267,1568,7490,32814,139638,590254,2496332,10583872,44986080,
%T A224408 191565628,816675452,3483688120,14864259432,63428734440,270666075032,
%U A224408 1154981259240,4928419635424,21029737949696,89733758819456
%N A224408 Number of n X 7 0..1 arrays with rows unimodal and antidiagonals nondecreasing.
%C A224408 Column 7 of A224409.
%H A224408 R. H. Hardin, <a href="/A224408/b224408.txt">Table of n, a(n) for n = 1..210</a>
%F A224408 Empirical: a(n) = 8*a(n-1) - 20*a(n-2) + 18*a(n-3) - 4*a(n-4) + 2*a(n-5) + 8*a(n-6) + 32*a(n-7) for n>8.
%F A224408 Empirical g.f.: x*(29 + 35*x + 12*x^2 - 236*x^3 - 436*x^4 - 288*x^5 + 116*x^6 + 168*x^7) / (1 - 8*x + 20*x^2 - 18*x^3 + 4*x^4 - 2*x^5 - 8*x^6 - 32*x^7). - _Colin Barker_, Aug 30 2018
%e A224408 Some solutions for n=3:
%e A224408 ..0..0..0..0..0..1..1....1..0..0..0..0..0..0....0..0..0..0..1..0..0
%e A224408 ..0..0..0..0..1..1..0....0..0..0..0..0..1..1....0..0..0..1..1..0..0
%e A224408 ..1..1..1..1..1..1..1....0..0..0..0..1..1..0....1..1..1..1..1..1..0
%Y A224408 Cf. A224409.
%K A224408 nonn
%O A224408 1,1
%A A224408 _R. H. Hardin_, Apr 05 2013