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.

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

Original entry on oeis.org

4, 6, 18, 34, 86, 180, 426, 930, 2140, 4758, 10818, 24240, 54834, 123274, 278260, 626446, 1412746, 3182416, 7174106, 16164834, 36434260, 82103270, 185041218, 417002816, 939796802, 2117936730, 4773120596, 10756848350, 24242204506
Offset: 1

Views

Author

R. H. Hardin, Nov 08 2012

Keywords

Comments

Row 2 of A218897.

Examples

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

Crossrefs

Cf. A218897.

Formula

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