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.

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

Original entry on oeis.org

7, 163, 2265, 31857, 461681, 6639893, 95431043, 1372612359, 19740345667, 283887907827, 4082690596769, 58714522782689, 844392025770105, 12143471562419701, 174639147022394875, 2511541333793121239
Offset: 1

Views

Author

R. H. Hardin Nov 09 2012

Keywords

Comments

Column 4 of A219002

Examples

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

Formula

Empirical: a(n) = 10*a(n-1) +42*a(n-2) +282*a(n-3) +281*a(n-4) +148*a(n-5) -320*a(n-6) -320*a(n-7) -256*a(n-8)