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.

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

Original entry on oeis.org

51, 40148, 34679839, 30147154218, 26207146328784, 22781978610167987, 19804473216531794553, 17216114684815070366422, 14966043352402318383229010, 13010046560219625329665338289, 11309690043874236949034566968117
Offset: 1

Views

Author

R. H. Hardin Nov 22 2011

Keywords

Comments

Column 5 of A200801

Examples

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