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.

A250805 Number of (n+1)X(n+1) 0..2 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

36, 379, 3081, 20631, 120304, 634509, 3104985, 14345803, 63351756, 269772537, 1114996177, 4494912111, 17741279760, 68762781541, 262334037201, 987009622419, 3668074098940, 13482629809713, 49069419165081, 176992814380663
Offset: 1

Views

Author

R. H. Hardin, Nov 27 2014

Keywords

Comments

Diagonal of A250812

Examples

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