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.

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

Original entry on oeis.org

0, 4, 1, 3, 9, 19, 31, 199, 330, 1377, 6627, 23223, 113179, 849856, 5207476, 43357615
Offset: 1

Views

Author

R. H. Hardin, Jan 29 2018

Keywords

Comments

Diagonal of A298924.

Examples

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

Crossrefs

Cf. A298924.