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.

A297801 Number of nX7 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 5 neighboring 1s.

Original entry on oeis.org

1, 381, 6215, 115773, 4340367, 123361724, 3420197908, 102189481612, 2993486726263, 87036084096735, 2550795725760992, 74669036575156557, 2183108544954393549, 63879977618932856370, 1869145222162376267997
Offset: 1

Views

Author

R. H. Hardin, Jan 06 2018

Keywords

Comments

Column 7 of A297802.

Examples

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

Crossrefs

Cf. A297802.