T(n,k) is the 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 k or less and triangles differing by a constant counted only once.

A195220

T(n,k) is the 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 k or less and triangles differing by a constant counted only once.

Terms

    a(0) =1a(1) =1a(2) =7a(3) =1a(4) =19a(5) =91a(6) =1a(7) =37a(8) =1047a(9) =2277a(10) =1a(11) =61a(12) =5453a(13) =176471a(14) =111031a(15) =1a(16) =91a(17) =18903a(18) =3395245a(19) =92031109a(20) =10654607a(21) =1a(22) =127a(23) =51205a(24) =31640829a(25) =9032683465a(26) =149824887097a(27) =2021888119a(28) =1a(29) =169

External references