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.

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

Original entry on oeis.org

1, 121, 107811, 724789395, 37235577669213, 14698398557250127027, 44727914263743356875711779, 1051443054205968885835418306282537
Offset: 1

Views

Author

R. H. Hardin Sep 14 2011

Keywords

Comments

Column 5 of A195278

Examples

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