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.

A218819 Unmatched value maps: number of nX4 binary arrays indicating the locations of corresponding elements not equal to any king-move neighbor in a random 0..2 nX4 array.

Original entry on oeis.org

7, 108, 1028, 8961, 80692, 720305, 6449353, 57696032, 516297052, 4619740712, 41337798409, 369890905178, 3309794955133, 29616122507437, 265005821287188, 2371278692119396, 21218261329031222, 189861534294482599
Offset: 1

Views

Author

R. H. Hardin Nov 06 2012

Keywords

Comments

Column 4 of A218823

Examples

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

Formula

Empirical: a(n) = 13*a(n-1) -30*a(n-2) -97*a(n-3) +386*a(n-4) -89*a(n-5) -794*a(n-6) +557*a(n-7) +352*a(n-8) -279*a(n-9) -56*a(n-10) +40*a(n-11) +7*a(n-12) -3*a(n-13) for n>14