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!)
A218065 Number of 2 X n arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..1 2 X n array. 1

%I #9 Jul 23 2018 14:23:43

%S 4,6,18,42,108,268,676,1694,4258,10690,26852,67436,169372,425382,

%T 1068370,2683258,6739132,16925644,42509556,106764750,268144706,

%U 673458066,1691421684,4248085292,10669266476,26796365718,67300335730,169027965834

%N Number of 2 X n arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..1 2 X n array.

%C Row 2 of A218064.

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

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

%F Empirical g.f.: 2*x*(2 + x - 2*x^2 - 2*x^3) / ((1 - x)*(1 + x)*(1 - x - 3*x^2 - 2*x^3)). - _Colin Barker_, Jul 23 2018

%e Some solutions for n=3:

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

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

%Y Cf. A218064.

%K nonn

%O 1,1

%A _R. H. Hardin_, Oct 19 2012

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 24 15:57 EDT 2024. Contains 371961 sequences. (Running on oeis4.)