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.

A218837 Unmatched value maps: number of n X 3 binary arrays indicating the locations of corresponding elements not equal to any horizontal or antidiagonal neighbor in a random 0..1 n X 3 array.

Original entry on oeis.org

4, 20, 93, 436, 2043, 9573, 44857, 210190, 984904, 4615043, 21625074, 101330329, 474811581, 2224862385, 10425214612, 48850257184, 228901534957, 1072582125992, 5025883366023, 23550181377025, 110350957732161, 517080258425742
Offset: 1

Views

Author

R. H. Hardin, Nov 07 2012

Keywords

Comments

Column 3 of A218842.

Examples

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

Crossrefs

Cf. A218842.

Formula

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