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

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

%S 1,121,107811,724789395,37235577669213,14698398557250127027,

%T 44727914263743356875711779,1051443054205968885835418306282537

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

%C Column 5 of A195278

%e Some solutions for n=5

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

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

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

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

%e ...3.-2..1.-1..2...2.-3.-6.-7.-6...9..8..5..1.-4...0..3..2..3..2..-1.-2.-1.-1.-3

%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 July 18 00:08 EDT 2024. Contains 374377 sequences. (Running on oeis4.)