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.

A219436 Unmatched value maps: number of nX3 binary arrays indicating the locations of corresponding elements not equal to any horizontal, diagonal or antidiagonal neighbor in a random 0..1 nX3 array.

Original entry on oeis.org

4, 18, 78, 329, 1396, 5925, 25147, 106731, 452984, 1922547, 8159665, 34631193, 146981443, 623817540, 2647601755, 11236931619, 47691701338, 202412762994, 859078738551, 3646095572825, 15474731627673, 65677740521441
Offset: 1

Views

Author

R. H. Hardin Nov 20 2012

Keywords

Comments

Column 3 of A219441

Examples

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

Formula

Empirical: a(n) = 4*a(n-1) +a(n-2) +a(n-3) -2*a(n-4) -6*a(n-5) -3*a(n-6) -2*a(n-7) +5*a(n-8) +4*a(n-9) -2*a(n-10) -2*a(n-11)