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!)
A195213 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 1 or less and triangles differing by a constant counted only once 2

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

%S 1,7,91,2277,111031,10654607,2021888119,761408842173,570411420721871,

%T 851650667866314005,2537743716708476573853,15108768742290768272235707,

%U 179885152873727967922701202921,4286156683596201247493358770260469

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

%C Column 1 of A195220

%H R. H. Hardin, <a href="/A195213/b195213.txt">Table of n, a(n) for n = 1..16</a>

%e Some solutions for n=5

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

%e ...1..0...........-1.-1...........-1..0...........-1..0............1..1

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

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

%e ...1..0..1..0..0..-1.-1.-2.-1.-2...0..0..1..1..2...1..0.-1.-2.-1...0..0..1..1..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 April 23 12:44 EDT 2024. Contains 371913 sequences. (Running on oeis4.)