The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A251244 Number of (n+1)X(3+1) 0..2 arrays with no 2X2 subblock having the sum of its diagonal elements less than the minimum of its antidiagonal elements 1

%I #4 Dec 01 2014 07:09:40

%S 5139,327753,20904689,1333268433,85032883789,5423196612609,

%T 345878548314469,22059307525808241,1406889917539387453,

%U 89728076602595409057,5722642281407762900517,364976447934805630538193

%N Number of (n+1)X(3+1) 0..2 arrays with no 2X2 subblock having the sum of its diagonal elements less than the minimum of its antidiagonal elements

%C Column 3 of A251249

%H R. H. Hardin, <a href="/A251244/b251244.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 81*a(n-1) -1165*a(n-2) +4257*a(n-3) -544*a(n-4) -4428*a(n-5) +7512*a(n-6) -80352*a(n-7) -67376*a(n-8) +32256*a(n-9) +20160*a(n-10)

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 01 2014

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.

Last modified August 11 01:05 EDT 2024. Contains 375059 sequences. (Running on oeis4.)