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.

A282784 Number of n X n 0..1 arrays with no 1 equal to more than one of its king-move neighbors, with the exception of exactly one element.

Original entry on oeis.org

0, 0, 73, 1952, 208559, 34974844, 12713143876, 10031326473244, 16844842566734425, 61957626701788646084, 497581272671041376917187
Offset: 1

Views

Author

R. H. Hardin, Feb 21 2017

Keywords

Comments

Diagonal of A282791.

Examples

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

Crossrefs

Cf. A282791.