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.

A250795 Number of (n+1) X (6+1) 0..1 arrays with nondecreasing min(x(i,j), x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.

Original entry on oeis.org

530, 1818, 6230, 21610, 76110, 270598, 968942, 3485538, 12580830, 45517150, 164970110, 598685226, 2174802030, 7906183238, 28758522030, 104655742642, 380990823486, 1387358367918, 5053131325982, 18408177907066, 67069331582158
Offset: 1

Views

Author

R. H. Hardin, Nov 27 2014

Keywords

Comments

Column 6 of A250797.

Examples

			Some solutions for n=4
..1..1..1..1..0..0..1....1..0..0..1..0..0..1....1..0..0..0..1..0..1
..1..1..1..1..0..1..0....1..0..0..1..0..1..0....0..1..1..1..0..1..0
..1..1..1..1..0..0..1....1..0..0..0..1..0..1....0..1..1..1..1..0..1
..1..1..1..1..0..1..0....1..0..0..1..0..1..0....0..1..1..1..1..0..0
..1..1..1..1..0..1..1....1..0..0..1..0..1..1....0..1..1..1..1..0..1
		

Crossrefs

Cf. A250797.

Formula

Empirical: a(n) = 12*a(n-1) -49*a(n-2) +50*a(n-3) +165*a(n-4) -408*a(n-5) +a(n-6) +618*a(n-7) -224*a(n-8) -344*a(n-9) +108*a(n-10) +72*a(n-11).