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!)
A250958 Number of (n+1) X (1+1) 0..3 arrays with no 2 X 2 subblock having its minimum diagonal element less than its minimum antidiagonal element. 1

%I #11 Nov 24 2018 08:11:39

%S 170,1592,14423,130025,1172956,10588744,95612685,863389506,7796459439,

%T 70402180164,635731893289,5740658602219,51838142971409,

%U 468098406239405,4226928439879553,38169162413062088,344667524042889328

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

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

%F Empirical: a(n) = 16*a(n-1) - 86*a(n-2) + 248*a(n-3) - 397*a(n-4) + 361*a(n-5) - 168*a(n-6) + 36*a(n-7).

%F Empirical g.f.: x*(170 - 1128*x + 3571*x^2 - 5991*x^3 + 5608*x^4 - 2652*x^5 + 576*x^6) / (1 - 16*x + 86*x^2 - 248*x^3 + 397*x^4 - 361*x^5 + 168*x^6 - 36*x^7). - _Colin Barker_, Nov 24 2018

%e Some solutions for n=4:

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

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

%e 0 3 0 0 0 1 0 1 1 3 1 0 1 0 1 0 3 3 3 1

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

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

%Y Column 1 of A250965.

%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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 07:07 EDT 2024. Contains 371964 sequences. (Running on oeis4.)