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.

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

Original entry on oeis.org

21, 129, 1180, 9425, 78661, 647252, 5350080, 44159095, 364647622, 3010723330, 24858935864, 205253857220, 1694729679245, 13992960979394, 115536377026413, 953955009802438, 7876568121973188, 65034854910941849, 536976546612691621
Offset: 1

Views

Author

R. H. Hardin Nov 26 2012

Keywords

Comments

Column 6 of A219741

Examples

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

Formula

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