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

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

%I

%S 49481,144737,272547,563271,1078862,2160510,4230166,8587303,17595371,

%T 37245814,80267686,176914157,395061425,892649426,2030400282,

%U 4641838603,10641445579,24442851146,56201464318,129311654629,297631797905

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

%C Column 6 of A251028

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

%F Empirical: a(n) = 8*a(n-1) -25*a(n-2) +35*a(n-3) -7*a(n-4) -49*a(n-5) +77*a(n-6) -55*a(n-7) +20*a(n-8) -3*a(n-9) for n>14

%e Some solutions for n=2

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Nov 29 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 16 16:08 EDT 2022. Contains 356169 sequences. (Running on oeis4.)