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.

A268964 Number of n X n 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two not more than once.

Original entry on oeis.org

3, 60, 2016, 136080, 18852912, 5712070032, 3870355944960, 5963413766987592, 21098726553552173712, 172587783760354579099176, 3279749300107885644432555744, 145303202175464965696103410891992
Offset: 1

Views

Author

R. H. Hardin, Feb 16 2016

Keywords

Comments

Diagonal of A268971.

Examples

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

Crossrefs

Cf. A268971.