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.

A296951 Number of nX7 0..1 arrays with each 1 adjacent to 1, 3 or 5 king-move neighboring 1s.

Original entry on oeis.org

13, 608, 5763, 86139, 1898178, 29067775, 482228052, 8786244680, 148081034460, 2527093956658, 44081436520906, 756410616073885, 13001520369777372, 224610561730578221, 3867018822679814785, 66587006212100036798
Offset: 1

Views

Author

R. H. Hardin, Dec 22 2017

Keywords

Comments

Column 7 of A296952.

Examples

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

Crossrefs

Cf. A296952.