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

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

%I #10 Nov 24 2018 08:11:46

%S 49,308,1945,12281,77537,489543,3090834,19514643,123209858,777911692,

%T 4911511266,31009873218,195787443967,1236145757310,7804669708967,

%U 49276445682891,311117342524943,1964305653103961,12402062409962968

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

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

%F Empirical: a(n) = 8*a(n-1) - 13*a(n-2) + 17*a(n-3) - 14*a(n-4) + 3*a(n-5).

%F Empirical g.f.: x*(49 - 84*x + 118*x^2 - 108*x^3 + 24*x^4) / ((1 - x)*(1 - 7*x + 6*x^2 - 11*x^3 + 3*x^4)). - _Colin Barker_, Nov 24 2018

%e Some solutions for n=4:

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

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

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

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

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

%Y Column 2 of A250973.

%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 November 29 17:19 EST 2023. Contains 367445 sequences. (Running on oeis4.)