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.

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

Original entry on oeis.org

1, 61, 18903, 31640829, 289301569283, 14572563308953245, 4059527861103273129317, 6270118871204192400242141667, 53785756580019628016324622812810239
Offset: 1

Views

Author

R. H. Hardin Sep 13 2011

Keywords

Comments

Column 4 of A195220

Examples

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