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.

A195283 Number of lower triangles of a 7X7 integer array with each element differing from all of its vertical and horizontal neighbors by n or less and triangles differing by a constant counted only once.

Original entry on oeis.org

48439766655, 30812488814662125, 241338657495589799523, 203368493873412168605037, 44727914263743356875711779, 4011033701337366560359871745, 189393562987102056163761489375
Offset: 1

Views

Author

R. H. Hardin Sep 14 2011

Keywords

Comments

Row 7 of A195278

Examples

			Some solutions for n=5
...0.....................0.....................0
..-2.-6.................-1..2.................-5-10
...1.-4.-2..............-6.-3.-6..............-2.-5.-1
...1.-2..2..7...........-2.-4.-3.-1...........-7.-6.-5..0
..-2.-7.-2..3.-2.........3..0..1..3..0........-9.-8.-8.-5.-9
..-6-10.-6.-1.-5.-4......8..3..0.-1.-5-10.....-8.-6.-5.-9-12-17
..-6.-8.-3..1..0.-4.-3...4..2..4..2.-3.-5.-2.-13-11.-7.-5.-7-12-13