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.

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

Original entry on oeis.org

37, 277, 3606, 39905, 466288, 5350080, 61758332, 711479843, 8201909757, 94531063074, 1089590912023, 12558669019786, 144752526242487, 1668430514943073, 19230483410164823, 221652312986931867
Offset: 1

Views

Author

R. H. Hardin Nov 26 2012

Keywords

Comments

Column 7 of A219741

Examples

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

Formula

Zeilberger's Maple code (see links in A228285) would give a recurrence for this sequence. - N. J. A. Sloane, Aug 22 2013