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.

A297660 Number of 7 X n 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1, 2 or 3 neighboring 1's.

Original entry on oeis.org

1, 5854, 346032, 11089103, 864944851, 65775301075, 3863740405975, 241491673018271, 16106282322466255, 1037330977711576009, 66060513585267380291, 4262867141607164322540, 275167885341459174925030
Offset: 1

Views

Author

R. H. Hardin, Jan 02 2018

Keywords

Comments

Row 7 of A297654.

Examples

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

Crossrefs

Cf. A297654.