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.

A282640 Number of n X n 0..1 arrays with no 1 equal to more than one of its king-move neighbors.

Original entry on oeis.org

2, 11, 99, 2638, 133118, 15985259, 4257307148, 2506410920603, 3330699748741870, 9838180083513076754, 65038588812750477539631, 960673982564908731679446423, 31695946605234699442469207411170
Offset: 1

Views

Author

R. H. Hardin, Feb 20 2017

Keywords

Comments

Diagonal of A282647.

Examples

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

Crossrefs

Cf. A282647.