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.

A250541 Number of (n+1)X(5+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction.

Original entry on oeis.org

187000, 2701872, 23289547, 151170400, 824599694, 4013192386, 18064444143, 76961701472, 315204675572, 1254564769204, 4890689086931, 18781896020328, 71371001739442, 269293563149046, 1011736459116935, 3793520599786824
Offset: 1

Views

Author

R. H. Hardin, Nov 24 2014

Keywords

Comments

Column 5 of A250544

Examples

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

Formula

Empirical: a(n) = 30*a(n-1) -415*a(n-2) +3514*a(n-3) -20386*a(n-4) +85924*a(n-5) -272198*a(n-6) +661180*a(n-7) -1244717*a(n-8) +1822478*a(n-9) -2068955*a(n-10) +1802474*a(n-11) -1181760*a(n-12) +563888*a(n-13) -184752*a(n-14) +37152*a(n-15) -3456*a(n-16)