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.

A297869 Number of n X n 0..1 arrays with every element equal to 2, 3 or 5 king-move adjacent elements, with upper left element zero.

Original entry on oeis.org

0, 1, 0, 10, 80, 887, 13778, 428609, 15589226, 918365908
Offset: 1

Views

Author

R. H. Hardin, Jan 07 2018

Keywords

Comments

Diagonal of A297876.

Examples

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

Crossrefs

Cf. A297876.