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.

A195214 Number of lower triangles of an n X n integer array with each element differing from all of its diagonal, vertical, antidiagonal and horizontal neighbors by 2 or less and triangles differing by a constant counted only once.

Original entry on oeis.org

1, 19, 1047, 176471, 92031109, 149824887097, 764465228592699, 12257873230432791803, 618761146282316127586145, 98449515559059678433241253935, 49416410864494101822050533251357921
Offset: 1

Views

Author

R. H. Hardin Sep 13 2011

Keywords

Comments

Column 2 of A195220

Examples

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