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.

A251806 Number of (6+1)X(n+1) 0..3 arrays with no 2X2 subblock having x11-x00 less than x10-x01.

Original entry on oeis.org

27278035, 12140516092, 2255553135793, 224175608341756, 13902663302194715, 596244004665414586, 19010586449609604592, 475164885888410556180, 9691434735916414155212, 166393734233809655597676
Offset: 1

Views

Author

R. H. Hardin, Dec 09 2014

Keywords

Comments

Row 6 of A251801

Examples

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