login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A195216 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 4 or less and triangles differing by a constant counted only once 0

%I

%S 1,61,18903,31640829,289301569283,14572563308953245,

%T 4059527861103273129317,6270118871204192400242141667,

%U 53785756580019628016324622812810239

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

%C Column 4 of A195220

%e Some solutions for n=5

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

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

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

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

%e ..-6.-4.-4.-5.-7..-5.-5.-2.-4.-3...2..2..1..5..8...2..3..0.-2.-2..-3.-1.-1..0..0

%K nonn

%O 1,2

%A _R. H. Hardin_ Sep 13 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 1 19:48 EDT 2022. Contains 357172 sequences. (Running on oeis4.)