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.

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

Original entry on oeis.org

0, 3, 15, 40, 179, 1223, 13490, 231838, 6506278, 335604816
Offset: 1

Views

Author

R. H. Hardin, Feb 14 2018

Keywords

Comments

Diagonal of A299612.

Examples

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

Crossrefs

Cf. A299612.