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.

A219690 Number of 6Xn arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 6Xn array.

Original entry on oeis.org

21, 60, 655, 5726, 44816, 344926, 2709320, 21474269, 167685059, 1273322836, 9386203438, 67340577300, 471427290355, 3224592437317, 21562151377146, 141010883018273, 902366368908706, 5653483899077449, 34695071833947322
Offset: 1

Views

Author

R. H. Hardin Nov 25 2012

Keywords

Comments

Row 6 of A219686

Examples

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