|
%I #5 Dec 18 2015 18:17:45
%S 1,169,248261,3249312469,383752106451389,411207789366962687359,
%T 4011033701337366560359871745
%N Number of lower triangles of an n X n integer array with each element differing from all of its vertical and horizontal neighbors by 6 or less and triangles differing by a constant counted only once
%C Column 6 of A195278
%e Some solutions for n=5
%e ...0...............0...............0...............0...............0
%e ..-6.-1...........-1..3...........-3.-8............3..9...........-2.-7
%e .-10.-6.-8........-6.-1..3.........1.-5.-8........-1..5..5.........1.-1.-7
%e .-15-10.-6.-9.....-9.-4.-2.-2......2..1.-2..2......3..7..4..2......1..0.-1..2
%e .-17-14-12.-9.-8.-10.-8.-4.-2..3...2..4.-1.-4.-6...1..6..4..5..0...5.-1.-7.-2..4
%K nonn
%O 1,2
%A _R. H. Hardin_ Sep 14 2011
| 