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.

A269090 Number of n X n 0..3 arrays with some element plus some horizontally or vertically adjacent neighbor totalling three exactly once.

Original entry on oeis.org

0, 96, 31296, 37963968, 211625837280, 5826856525990272, 819944297332124826720, 600994567853371717147309536, 2321584677123190401202986846749664, 47631920426007575412576023256743509016160
Offset: 1

Views

Author

R. H. Hardin, Feb 19 2016

Keywords

Comments

Diagonal of A269097.

Examples

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

Crossrefs

Cf. A269097.