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.

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

Original entry on oeis.org

1, 1, 1, 3, 7, 14, 40, 168, 873, 5632, 63538, 1026354, 20200595, 622554839, 29122695476, 1747360635695, 149225079090933
Offset: 1

Views

Author

R. H. Hardin, Jan 29 2018

Keywords

Comments

Diagonal of A298917.

Examples

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

Crossrefs

Cf. A298917.