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.

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

Original entry on oeis.org

9, 46, 208, 885, 3605, 14437, 57397, 228455, 912438, 3661515, 14755226, 59674645, 241996099, 983339540, 4001469252, 16299591564, 66441841973, 270971703338, 1105502740041, 4511347592849, 18413367334909, 75165710188419
Offset: 1

Views

Author

R. H. Hardin, Nov 27 2014

Keywords

Comments

Diagonal of A250729.

Examples

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

Crossrefs

Cf. A250729.