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.

A232143 Number of (6+1)X(n+1) 0..2 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..2 introduced in row major order.

Original entry on oeis.org

136384, 122721280, 100495188564, 85000031249096, 71938229899528156, 60960050569112225624, 51664900164122521134304, 43790619829816652015279660, 37116830858835534221481687436, 31460303395632890116635219172352
Offset: 1

Views

Author

R. H. Hardin, Nov 19 2013

Keywords

Comments

Row 6 of A232137

Examples

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