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.

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

Original entry on oeis.org

342, 3381, 29366, 302121, 3130708, 34170727, 373664749, 4147016414, 46117392977, 515063996641, 5757867388323, 64448318261860, 721609183551621, 8082185902161731, 90528853400096455, 1014081345152953804
Offset: 1

Views

Author

R. H. Hardin, Nov 06 2013

Keywords

Comments

Row 5 of A231263

Examples

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