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.

A195215 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 3 or less and triangles differing by a constant counted only once.

Original entry on oeis.org

1, 37, 5453, 3395245, 9032683465, 103565705397639, 5137554141710397313, 1105495964728300359472149, 1033611648181176182212080096433, 4204060119607140359160709072654583501
Offset: 1

Views

Author

R. H. Hardin Sep 13 2011

Keywords

Comments

Column 3 of A195220

Examples

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