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.

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

Original entry on oeis.org

1, 4, 1, 25, 415, 1822, 167131, 14634300, 1518807971, 1088211703169
Offset: 1

Views

Author

R. H. Hardin, Feb 24 2018

Keywords

Comments

Diagonal of A300089.

Examples

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

Crossrefs

Cf. A300089.