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.

A224371 Number of nX5 0..2 arrays with rows unimodal and antidiagonals nondecreasing.

Original entry on oeis.org

86, 1915, 26314, 311367, 3607078, 42132769, 495660330, 5848449149, 69064897862, 815702088065, 9633856474182, 113778532335717, 1343744395119438, 15869813554422065, 187424656004529134, 2213510515188443829
Offset: 1

Views

Author

R. H. Hardin Apr 05 2013

Keywords

Comments

Column 5 of A224374

Examples

			Some solutions for n=3
..1..0..0..0..0....0..1..1..1..0....1..0..0..0..0....1..0..0..0..0
..0..0..2..0..0....2..2..2..1..1....1..2..2..2..2....0..0..1..0..0
..0..2..2..2..1....2..2..2..1..0....2..2..2..2..1....1..2..2..2..1
		

Formula

Empirical: a(n) = 21*a(n-1) -141*a(n-2) +427*a(n-3) -546*a(n-4) +526*a(n-5) -2124*a(n-6) +3302*a(n-7) +2396*a(n-8) +7504*a(n-9) +580*a(n-10) +1632*a(n-11) for n>13