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.

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

Original entry on oeis.org

0, 1, 1, 11, 94, 955, 15163, 491338, 19329083, 1185260593
Offset: 1

Views

Author

R. H. Hardin, Jan 29 2018

Keywords

Comments

Diagonal of A298930.

Examples

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

Crossrefs

Cf. A298930.