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!)
A186120 Number of (n+1) X 2 binary arrays with every 2 X 2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2 X 2 subblock diagonal sum less antidiagonal sum. 1

%I #12 Apr 17 2018 12:13:02

%S 0,14,18,50,74,182,298,678,1186,2566,4690,9830,18498,38006,72914,

%T 147974,287554,579222,1135282,2276710,4488226,8978102,17768850,

%U 35496326,70442882,140631254,279616498,558094758,1111168738,2217823222,4420075090

%N Number of (n+1) X 2 binary arrays with every 2 X 2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2 X 2 subblock diagonal sum less antidiagonal sum.

%C Column 1 of A186128.

%H R. H. Hardin, <a href="/A186120/b186120.txt">Table of n, a(n) for n = 1..200</a>

%F Empirical: a(n) = 3*a(n-1) - 6*a(n-3) + 6*a(n-4) - 4*a(n-5) for n>6.

%F Empirical g.f.: 2*x^2*(7 - 12*x - 2*x^2 + 4*x^3 - 8*x^4) / ((1 - 2*x)*(1 - x - 2*x^2 + 2*x^3 - 2*x^4)). - _Colin Barker_, Apr 17 2018

%e Some solutions for 3 X 2:

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

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

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

%Y Cf. A186128.

%K nonn

%O 1,2

%A _R. H. Hardin_, Feb 13 2011

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 19 11:31 EDT 2024. Contains 371792 sequences. (Running on oeis4.)