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.

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

Original entry on oeis.org

1, 8, 228, 22194, 7452385, 8664017314, 34824178698922, 483558835111191345, 23194796188589638077072
Offset: 1

Views

Author

R. H. Hardin, Feb 28 2018

Keywords

Comments

Diagonal of A300215.

Examples

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

Crossrefs

Cf. A300215.