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.

A268621 Number of n X n 0..2 arrays with some element plus some horizontally or vertically adjacent neighbor totaling two no more than once.

Original entry on oeis.org

3, 42, 1086, 55452, 6000978, 1430057208, 767057092212, 938662461734076, 2643885168776274078, 17245474696462104041796, 261641272761781630830646332, 9262823664147270920479995625968, 767111588793900754143144516979246884
Offset: 1

Views

Author

R. H. Hardin, Feb 09 2016

Keywords

Comments

Diagonal of A268628.

Examples

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

Crossrefs

Cf. A268628.