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.

A199652 Number of nX5 0..2 arrays with values 0..2 introduced in row major order and each element equal to no more than two horizontal and vertical neighbors.

Original entry on oeis.org

41, 8037, 1357484, 230693158, 39209840355, 6663970316970, 1132589231853096, 192491652879392515, 32715334199617664326, 5560205218374521415185, 944996676143473092852595, 160608949278619262130353064
Offset: 1

Views

Author

R. H. Hardin Nov 08 2011

Keywords

Comments

Column 5 of A199655

Examples

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