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

 


Number of lower triangles of a 6 X 6 integer array with each element differing from all of its diagonal, vertical, antidiagonal and horizontal neighbors by n or less and triangles differing by a constant counted only once.
1

%I #11 Oct 07 2019 01:57:30

%S 10654607,149824887097,103565705397639,14572563308953245,

%T 774355028021195459,21369796486647028143,368448539594713382337,

%U 4459232627488479738855,40959753617162679435381,301639473232633417395629

%N Number of lower triangles of a 6 X 6 integer array with each element differing from all of its diagonal, vertical, antidiagonal and horizontal neighbors by n or less and triangles differing by a constant counted only once.

%C Row 6 of A195220.

%C a(n) is an Ehrhart polynomial of degree 20. - _Robert Israel_, Oct 07 2019

%H R. H. Hardin, <a href="/A195224/b195224.txt">Table of n, a(n) for n = 1..17</a>

%e Some solutions for n=5:

%e 0 0 0 0

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

%e 2 1 2 -1 -1 -5 -1 -1 -2 6 5 1

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Sep 13 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 24 03:45 EDT 2024. Contains 376185 sequences. (Running on oeis4.)