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.

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

Original entry on oeis.org

1, 25, 2125, 626525, 649112125, 2375645170875, 30812488814662125, 1419187229961716246975, 232443697109891957009442125, 135513533218801266004475511024825
Offset: 1

Views

Author

R. H. Hardin Sep 14 2011

Keywords

Comments

Column 2 of A195278

Examples

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