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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A251489 Number of (n+1)X(6+1) 0..3 arrays with no 2X2 subblock having the sum of its diagonal elements less than the minimum of its antidiagonal elements 1

%I #4 Dec 03 2014 10:10:18

%S 158478336,1575813859456,15661071542167376,155634922739125247648,

%T 1546645977595845122949056,15370016315641490766809697920,

%U 152741708226257877188571836140832,1517892242344262925503829520026004048

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

%C Column 6 of A251491

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

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 03 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 December 2 23:17 EST 2023. Contains 367526 sequences. (Running on oeis4.)