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.

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

Original entry on oeis.org

1, 8, 255, 32321, 16288960, 32640586945, 260070240849459, 8239275981240122104, 1037894641315598870418625, 519856344665932729699372254283, 1035331146709687346593709910443435692
Offset: 1

Views

Author

R. H. Hardin, Feb 27 2018

Keywords

Comments

Diagonal of A300182.

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..0..0..0..1. .0..0..0..0..1. .0..0..0..1..0. .0..0..0..0..0
..1..1..1..0..1. .1..0..1..1..1. .1..1..0..1..0. .0..1..0..1..1
..0..0..0..1..0. .0..0..0..1..1. .1..1..1..1..1. .1..0..0..1..0
..1..1..0..1..0. .0..0..0..0..0. .1..1..1..1..0. .0..0..1..0..0
		

Crossrefs

Cf. A300182.