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.

A296828 Number of n X n 0..1 arrays with each 1 adjacent to 0, 3 or 5 king-move neighboring 1's.

Original entry on oeis.org

2, 6, 43, 573, 14379, 706534, 67007971, 12228697715, 4321362259224, 2948102949160889
Offset: 1

Views

Author

R. H. Hardin, Dec 21 2017

Keywords

Comments

Diagonal of A296834.

Examples

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

Crossrefs

Cf. A296834.