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

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

%S 1,19,1047,176471,92031109,149824887097,764465228592699,

%T 12257873230432791803,618761146282316127586145,

%U 98449515559059678433241253935,49416410864494101822050533251357921

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

%C Column 2 of A195220

%H R. H. Hardin, <a href="/A195214/b195214.txt">Table of n, a(n) for n = 1..12</a>

%e Some solutions for n=5

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

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

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

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

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

%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 24 19:39 EDT 2024. Contains 371963 sequences. (Running on oeis4.)