login
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 3 or less and triangles differing by a constant counted only once
0

%I #5 Dec 18 2015 18:17:45

%S 1,37,5453,3395245,9032683465,103565705397639,5137554141710397313,

%T 1105495964728300359472149,1033611648181176182212080096433,

%U 4204060119607140359160709072654583501

%N 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 3 or less and triangles differing by a constant counted only once

%C Column 3 of A195220

%e Some solutions for n=5

%e ...0...............0...............0...............0...............0

%e ..-3.-1............3..0...........-1.-1............0..3............2..1

%e ..-1.-2.-2.........2..1..3.........2.-1.-4.........1..2..4.........3..3..4

%e ...1..0..0.-3.....-1..2..3..2.....-1.-1.-2.-5......3..3..1..1......3..1..3..5

%e ...3..0.-2.-1..0...1..0..2..1..0...0.-2.-2.-2.-3...2..0..1..2.-1...2..0..3..5..7

%K nonn

%O 1,2

%A _R. H. Hardin_ Sep 13 2011