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.

A209093 Number of n X n 0..2 arrays with new values 0..2 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors.

Original entry on oeis.org

1, 11, 1326, 849548, 2896732704, 52675800891748, 5112092569118325704, 2648032740541890194825808, 7321189749687647765176559002512, 108035622217854017447945402727365754008
Offset: 1

Views

Author

R. H. Hardin, Mar 05 2012

Keywords

Comments

Diagonal of A209100.

Examples

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

Crossrefs

Cf. A209100.