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.

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

Original entry on oeis.org

1, 49, 11319, 12608631, 68604760497, 1833160598134397, 241338657495589799523, 156865927758847103008175635, 504091149328239931994947830412175
Offset: 1

Views

Author

R. H. Hardin Sep 14 2011

Keywords

Comments

Column 3 of A195278

Examples

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