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

%I #7 Mar 09 2018 19:33:03

%S 4,18,74,308,1282,5338,22228,92562,385450,1605108,6684066,27834106,

%T 115908116,482670130,2009958090,8369963828,34854604610,145143215386,

%U 604412335444,2516922821842,10481090672106,43645860224116

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

%C Column 3 of A218064.

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

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

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

%e Some solutions for n=3:

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

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

%e ..0..0..1....0..0..0....1..1..1....1..0..1....1..1..1....1..0..0....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 May 5 09:41 EDT 2024. Contains 372266 sequences. (Running on oeis4.)