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!)
A195272 Number of lower triangles of an n X n integer array with each element differing from all of its vertical and horizontal neighbors by 2 or less and triangles differing by a constant counted only once 1

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

%S 1,25,2125,626525,649112125,2375645170875,30812488814662125,

%T 1419187229961716246975,232443697109891957009442125,

%U 135513533218801266004475511024825

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

%C Column 2 of A195278

%H R. H. Hardin, <a href="/A195272/b195272.txt">Table of n, a(n) for n = 1..11</a>

%e Some solutions for n=5

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

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

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

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

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

%K nonn

%O 1,2

%A _R. H. Hardin_ Sep 14 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 May 6 12:10 EDT 2024. Contains 372293 sequences. (Running on oeis4.)