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.

A280852 Number of n X n 0..2 arrays with no element equal to more than one of its king-move neighbors and with new values introduced in order 0 sequentially upwards.

Original entry on oeis.org

1, 9, 46, 124, 282, 712, 1738, 4124, 9562, 21752, 48730, 107992, 237082, 516376, 1117210
Offset: 1

Views

Author

R. H. Hardin, Jan 09 2017

Keywords

Comments

Diagonal of A280859.

Examples

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

Crossrefs

Cf. A280859.