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.

A222651 Number of nX2 0..3 arrays with no more than floor(nX2/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..3 order.

Original entry on oeis.org

1, 7, 60, 724, 7364, 84816, 927152, 10585088, 119198624, 1364437632, 15584195392, 179262541056, 2063988209152, 23852186896896, 276080500860416, 3202923732204544, 37215026284325888, 433119059193262080
Offset: 1

Views

Author

R. H. Hardin Feb 27 2013

Keywords

Comments

Column 2 of A222654

Examples

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