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.

A201800 Number of zero-sum nX5 -2..2 arrays with every element unequal to at most two horizontal and vertical neighbors.

Original entry on oeis.org

381, 28625, 562961, 20960485, 722587629, 27941324053, 1077779765471
Offset: 1

Views

Author

R. H. Hardin Dec 05 2011

Keywords

Comments

Column 5 of A201803

Examples

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