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.

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

Original entry on oeis.org

2, 6, 39, 467, 10290, 431844, 33703065, 4933593439, 1353357158724, 695062929397500, 668849535352606829, 1205528922118577365911
Offset: 1

Views

Author

R. H. Hardin, Nov 29 2017

Keywords

Comments

Diagonal of A295918.

Examples

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

Crossrefs

Cf. A295918.