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

%I #5 Mar 31 2012 12:36:24

%S 6939,626525,12608631,119743353,724789395,3249312469,11755976175,

%T 36215968241,98454861067,242177297229,548894457959,1162058315625,

%U 2322243189891,4416808121541,8048123047903,14125147709409,23983914638075

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

%C Row 4 of A195278

%H R. H. Hardin, <a href="/A195280/b195280.txt">Table of n, a(n) for n = 1..169</a>

%F Empirical: a(n) = (49024/315)*n^9 + (24512/35)*n^8 + (457792/315)*n^7 + (81824/45)*n^6 + (67912/45)*n^5 + (38756/45)*n^4 + (11832/35)*n^3 + (27752/315)*n^2 + (1454/105)*n + 1

%e Some solutions for n=5

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

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

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

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

%K nonn

%O 1,1

%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 7 21:53 EDT 2024. Contains 372317 sequences. (Running on oeis4.)