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.

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

Original entry on oeis.org

1, 8, 220, 21111, 6896530, 7790212998, 30260326859957, 404132235613627376, 18556239226034408691425
Offset: 1

Views

Author

R. H. Hardin, Feb 18 2018

Keywords

Comments

Diagonal of A299740.

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

Crossrefs

Cf. A299740.