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.

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

Original entry on oeis.org

37, 2097, 34757, 1247716, 35049871, 978288822, 28914051279, 823340493402, 23748019543354, 684563956136832, 19685697905900807, 567106229569054219, 16326031115140984900, 470031756510991757935, 13533758185630160222532
Offset: 1

Views

Author

R. H. Hardin, Dec 31 2017

Keywords

Comments

Column 7 of A297506.

Examples

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

Crossrefs

Cf. A297506.