cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Original entry on oeis.org

4, 18, 74, 308, 1282, 5338, 22228, 92562, 385450, 1605108, 6684066, 27834106, 115908116, 482670130, 2009958090, 8369963828, 34854604610, 145143215386, 604412335444, 2516922821842, 10481090672106, 43645860224116
Offset: 1

Views

Author

R. H. Hardin, Oct 19 2012

Keywords

Comments

Column 3 of A218064.

Examples

			Some solutions for n=3:
..0..0..1....1..1..0....1..0..0....0..0..1....0..0..0....1..0..1....0..0..1
..1..0..0....0..0..0....1..0..1....1..0..0....1..0..1....0..0..1....1..0..1
..0..0..1....0..0..0....1..1..1....1..0..1....1..1..1....1..0..0....0..0..0
		

Crossrefs

Cf. A218064.

Formula

Empirical: a(n) = 5*a(n-1) - 3*a(n-2) - 2*a(n-3).
Empirical g.f.: 2*x*(2 - x - 2*x^2) / (1 - 5*x + 3*x^2 + 2*x^3). - Colin Barker, Mar 09 2018