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.

A232286 Number of 6Xn 0..2 arrays with no element less than a strict majority of its horizontal, diagonal and antidiagonal neighbors.

Original entry on oeis.org

729, 4040, 1774344, 340593196, 47260154104, 6001447087200, 933667586918234, 152822604107404316, 23700054790070627876, 3547415716186113564021, 537242807813691258204946, 82687243581225013103289774
Offset: 1

Views

Author

R. H. Hardin, Nov 22 2013

Keywords

Comments

Row 6 of A232281

Examples

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