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.

A250682 Number of (6+1)X(n+1) 0..3 arrays with nondecreasing 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

233300, 6325144, 148821788, 3135539502, 59036115470, 1009432228498, 15971487229178, 237007870055660, 3338014574159778, 45012529914668338, 585376680395128804, 7382961201465611866, 90721080710158378470
Offset: 1

Views

Author

R. H. Hardin, Nov 26 2014

Keywords

Comments

Row 6 of A250676

Examples

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